Suchergebnisse - "POLYNOMIAL-TIME APPROXIMATION SCHEME"

New Algorithms for Steiner Tree Reoptimization

Autoren: Bilò Davide Davide Bilò

Weitere Verfasser: Bilò Davide Davide Bilò

Quelle: Algorithmica. 86:2652-2675

Schlagwörter: FOS: Computer and information sciences, Approximation algorithms, Reoptimization, Steiner tree problem, Steiner tree, Polynomial-time approximation scheme, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, reoptimization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, approximation algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1804.10791
https://hdl.handle.net/11388/221875
http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04
https://doi.org/10.4230/LIPIcs.ICALP.2018.19
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.19
https://hdl.handle.net/11697/179740
https://doi.org/10.4230/LIPIcs.ICALP.2018.19

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

Autoren: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Weitere Verfasser: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Optimization and Control (math.OC), Optimization and Control, Branch-and-bound algorithm, FOS: Mathematics, Data Structures and Algorithms (cs.DS), ddc:004, Polynomial-time approximation scheme, Knapsack problem, Parallel machine scheduling problem

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.15885
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.73

Approximation Schemes for Capacity Vehicle Routing Problems: A Survey

Autoren: Chen, Y.

Quelle: 2023 2nd International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)
Proceedings-2023 2nd International Conference on Computational Modelling, Simulation and Optimization, ICCMSO 2023

Schlagwörter: FOS: Computer and information sciences, APPROXIMATION SCHEME, CLASSIFIEDS, Data Structures and Algorithms, Discrete Mathematics (cs.DM), ROUTING ALGORITHMS, COMBINATORIAL OPTIMIZATION PROBLEMS, Discrete Mathematics, F.2.0, G.2.2, LOGISTICS NETWORK, POLYNOMIAL APPROXIMATION, COMBINATORIAL OPTIMIZATION, OPTIMAL ROUTES, CAPACITATED VEHICLE ROUTING PROBLEM, CAPACITY VEHICLE ROUTING PROBLEMS, POLYNOMIAL TIME APPROXIMATION SCHEMES, APPROXIMATION ALGORITHMS, VEHICLES, Data Structures and Algorithms (cs.DS), VEHICLE ROUTING, TOTAL DISTANCES, POLYNOMIAL-TIME APPROXIMATION SCHEME, CAPACITY CONSTRAINTS

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2306.01826
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85181172283&doi=10.1109/ICCMSO59960.2023.00059&partnerID=40&md5=f24e85db0e8ce863d2acdf7e0f49fd2f
https://arxiv.org/pdf/2306.01826
http://elar.urfu.ru/handle/10995/131099

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs

Autoren: Klein, Philip N. Mathieu, Claire Zhou, Hang et al.

Weitere Verfasser: Klein, Philip N. Mathieu, Claire Zhou, Hang et al.

Quelle: Algorithmica. 85:3024-3057

Schlagwörter: correlation clustering, two-edge-connected augmentation, polynomial-time approximation scheme, ddc:004, planar graphs

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2015/4941/pdf/41.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2015.html#KleinMZ15
https://drops.dagstuhl.de/opus/volltexte/2015/4941/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.554

Assortment optimization under the multinomial logit choice model with product-specific capacities

Autoren: Huh, Woonghee Tim Liu, Siyue

Quelle: Operations Research Letters. 59:107238

Schlagwörter: fully polynomial-time approximation scheme (FPTAS), assortment optimization, Operations research, mathematical programming, product-specific capacities

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8036075
https://doi.org/10.1016/j.orl.2024.107238

Packing squares independently

Autoren: Wei Wu Hiroki Numaguchi Nir Halman et al.

Quelle: Theoretical Computer Science. 1024:114910

Schlagwörter: dynamic programming, Combinatorial optimization, strip packing, fully polynomial-time approximation scheme, Packing and covering in \(2\) dimensions (aspects of discrete geometry), complexity, Combinatorial aspects of packing and covering, Approximation algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7957598
https://doi.org/10.1016/j.tcs.2024.114910

A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

Autoren: Xiaofang Zhao Shuguang Li

Quelle: Electronic Research Archive, Vol 30, Iss 11, Pp 4209-4219 (2022)

Schlagwörter: T57-57.97, maximum delivery completion time, Applied mathematics. Quantitative methods, polynomial time approximation scheme, QA1-939, 0211 other engineering and technologies, scheduling, 0102 computer and information sciences, 02 engineering and technology, inclusive processing set restrictions, unbounded batch machines, 01 natural sciences, Mathematics

Zugangs-URL: https://doaj.org/article/f40906efd8224352bcd889b62717e2c2

Scheduling with non-renewable resources: minimizing the sum of completion times

Autoren: Bérczi, Kristóf Király, Tamás Omlor, Simon

Schlagwörter: ddc:650, Approximation algorithm, Non-renewable resources, Polynomial-time approximation scheme, Strong NP-hardness, Scheduling, Weighted sum of completion times

Relation: https://hdl.handle.net/10419/315300

Verfügbarkeit: https://hdl.handle.net/10419/315300
https://doi.org/10.1007/s10951-024-00807-y

Maximizing the Number of Visible Labels on a Rotating Map

Autoren: Ali Gholami Rudi

Quelle: Scientific Annals of Computer Science, Vol XXXI, Iss 2, Pp 293-313 (2021)

Schlagwörter: rotating maps, Electronic computers. Computer science, geometric independent set, computational geometry, polynomial-time approximation scheme, map labelling, QA75.5-76.95

Optimal algorithms for scheduling under time-of-use tariffs

Autoren: Lin Chen Nicole Megow Roman Rischke et al.

Weitere Verfasser: Lin Chen Nicole Megow Roman Rischke et al.

Quelle: Annals of Operations Research. 304:85-107

Schlagwörter: FOS: Computer and information sciences, 12 Producción y consumo responsable, Makespan, ddc:000, Scheduling, 0211 other engineering and technologies, SDG 8 - Decent Work and Economic Growth, 02 engineering and technology, [INFO] Computer Science [cs], Dynamic programming, Polynomial-time approximation scheme (PTAS), 16. Peace & justice, Total weighted completion time, Time-of-use tariffs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 12 Responsible Consumption and Production

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s10479-021-04059-3.pdf
http://arxiv.org/abs/1811.12657
https://hdl.handle.net/1871.1/59ce8341-6069-4ec5-9401-532de77bc77a
https://research.vu.nl/en/publications/59ce8341-6069-4ec5-9401-532de77bc77a
https://link.springer.com/content/pdf/10.1007/s10479-021-04059-3.pdf
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F151c4d4e-8aeb-4d2e-972a-c7524815854e
https://par.nsf.gov/biblio/10294463-optimal-algorithms-scheduling-under-time-use-tariffs
https://ir.cwi.nl/pub/30756
http://doi.org/10.1007/s10479-021-04059-3
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-12657
https://hdl.handle.net/10419/287048

Energy-Efficient Task Allocation of Heterogeneous Resources in Mobile Edge Computing

Autoren: Xi Liu Jun Liu Hong Wu

Quelle: IEEE Access, Vol 9, Pp 119700-119711 (2021)

Schlagwörter: polynomial time approximation scheme, 0202 electrical engineering, electronic engineering, information engineering, Mobile edge computing, resource allocation, energy efficient, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, 7. Clean energy, computation offloading, TK1-9971, 12. Responsible consumption

Zugangs-URL: https://ieeexplore.ieee.org/ielx7/6287639/6514899/09524604.pdf
https://doaj.org/article/02ba5a609a884d4eab23c69e7e3c72e5
https://ieeexplore.ieee.org/document/9524604/
https://doi.org/10.1109/ACCESS.2021.3108342
https://dblp.uni-trier.de/db/journals/access/access9.html#0002LW21

Energy-efficient allocation for multiple tasks in mobile edge computing

Autoren: Jun Liu Xi Liu

Quelle: Journal of Cloud Computing: Advances, Systems and Applications, Vol 11, Iss 1, Pp 1-14 (2022)

Schlagwörter: Mobile edge computing, Energy efficient, Computation offloading, Polynomial time approximation scheme, Computer engineering. Computer hardware, TK7885-7895, Electronic computers. Computer science, QA75.5-76.95

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/2192-113X

Zugangs-URL: https://doaj.org/article/8d2461ebabbe439789c9682497c337ae

How fast can we reach a target vertex in stochastic temporal graphs?

Autoren: Christoforos L. Raptopoulos Eleni C. Akrida Paul G. Spirakis et al.

Weitere Verfasser: Christoforos L. Raptopoulos Eleni C. Akrida Paul G. Spirakis et al.

Quelle: Journal of Computer and System Sciences
Baier, Christel & Chatzigiannakis, Ioannis & Flocchini, Paola & Leonardi, Stefano (Eds.). (2019). 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl, Germany: Dagstuhl Publishing, pp. 131:1-131:14, Leibniz International Proceedings inInformatics (LIPIcs)(132)
Journal of computer and system sciences, 2020, Vol.114, pp.65-83 [Peer Reviewed Journal]

Schlagwörter: FOS: Computer and information sciences, Temporal network, polynomial-time approximation scheme, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), #P-hard problem, ddc:004, temporal path, stochastic temporal graph

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2019/10707/pdf/LIPIcs-ICALP-2019-131.pdf
http://arxiv.org/abs/1903.03636
http://livrepository.liverpool.ac.uk/3034420/1/1903.03636v1.pdf
http://livrepository.liverpool.ac.uk/3092258/1/Stochastic_Temporal_JCSS_040320.pdf
https://drops.dagstuhl.de/opus/volltexte/2019/10707/
https://doi.org/10.4230/LIPIcs.ICALP.2019.131
https://drops.dagstuhl.de/opus/volltexte/2019/10707/pdf/LIPIcs-ICALP-2019-131.pdf/
https://dro.dur.ac.uk/28214/
https://dblp.uni-trier.de/db/conf/icalp/icalp2019.html#AkridaMNRSZ19
http://dro.dur.ac.uk/28214/
https://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-03636
https://arxiv.org/pdf/1903.03636.pdf
https://livrepository.liverpool.ac.uk/3092258/
https://dro.dur.ac.uk/30795/
https://www.sciencedirect.com/science/article/abs/pii/S0022000020300507
http://dblp.uni-trier.de/db/journals/corr/corr1903.html#abs-1903-03636
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.131
http://dro.dur.ac.uk/30795/1/30795.pdf
http://dro.dur.ac.uk/30795/
https://doi.org/10.1016/j.jcss.2020.05.005

A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics

Autoren: Chan, T-H. Hubert Jiang, Haotian Jiang, Shaofeng H.-C. et al.

Weitere Verfasser: Chan, T-H. Hubert Jiang, Haotian Jiang, Shaofeng H.-C. et al.

Quelle: ACM Transactions on Algorithms. 16:1-23

Schlagwörter: FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Traveling Salesman Problem, Prize Collecting, Doubling Dimension, Computer Science - Data Structures and Algorithms, Polynomial Time Approximation Scheme, Data Structures and Algorithms (cs.DS), ddc:004, Steiner Tree Problem

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2018/9478/pdf/LIPIcs-ESA-2018-15.pdf
http://arxiv.org/abs/1710.07774
https://dl.acm.org/doi/10.1145/3378571
http://ui.adsabs.harvard.edu/abs/2017arXiv171007774C/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1710.html#abs-1710-07774
https://dblp.uni-trier.de/db/conf/esa/esa2018.html#ChanJJ18
https://drops.dagstuhl.de/opus/volltexte/2018/9478/
https://doi.org/10.4230/LIPIcs.ESA.2018.15
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.15

Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times

Autoren: Kristóf Bérczi Tamás Király Simon Omlor

Quelle: Lecture Notes in Computer Science ISBN: 9783030532611

Schlagwörter: Strong NP-hardness, FOS: Computer and information sciences, QA Mathematics / matematika, Discrete Mathematics (cs.DM), Weighted sum of completion times, Scheduling, 9. Industry and infrastructure, ddc:650, 0211 other engineering and technologies, PTAS, 0102 computer and information sciences, 02 engineering and technology, Approximation algorithm, 01 natural sciences, 7. Clean energy, Computer Science - Data Structures and Algorithms, 8. Economic growth, Data Structures and Algorithms (cs.DS), Non-renewable resources, Polynomial-time approximation scheme, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf; text

Zugangs-URL: http://real.mtak.hu/113036/1/B%C3%A9rczi2020_Chapter_SchedulingWithNon-renewableRes.pdf
http://arxiv.org/abs/1911.12138
https://link.springer.com/chapter/10.1007/978-3-030-53262-8_14
http://arxiv.org/pdf/1911.12138.pdf
https://rd.springer.com/chapter/10.1007/978-3-030-53262-8_14
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-12138
https://arxiv.org/abs/1911.12138
https://hdl.handle.net/10419/315300
http://hdl.handle.net/10831/113105

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets

Autoren: Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas et al.

Weitere Verfasser: Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas et al.

Schlagwörter: budgeted matroid intersection, ddc:004, efficient polynomial-time approximation scheme, budgeted matching, Theory of computation

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.49

Bounded mixed batch scheduling with job release dates and rejection

Autoren: Jun Xu Yong-Xing Huang Daxing Zhang et al.

Quelle: Operations Research Letters. 57:107159

Schlagwörter: polynomial-time approximation scheme, exact algorithm, mixed batch scheduling, Operations research, mathematical programming, rejection penalty, approximation algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8035938
https://doi.org/10.1016/j.orl.2024.107159

Efficient independent set approximation in unit disk graphs

Autoren: Das, Gautam da Fonseca, Guilherme Jallu, Ramesh et al.

Weitere Verfasser: Das, Gautam da Fonseca, Guilherme Jallu, Ramesh et al.

Quelle: Discrete Applied Mathematics. 280:63-70

Schlagwörter: [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Unit Disk Graph, 0211 other engineering and technologies, Polynomial Time Approximation Scheme, 0102 computer and information sciences, 02 engineering and technology, Approximation Algorithms, 01 natural sciences, Maximum Independent Set

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01893742/file/udg-is.pdf
https://hal.archives-ouvertes.fr/hal-01893742
https://www.sciencedirect.com/science/article/abs/pii/S0166218X1830310X
https://hal.archives-ouvertes.fr/hal-01893742/document

Rank Aggregation by Dissatisfaction Minimisation in the Unavailable Candidate Model

Autoren: Grivet Sébert, Arnaud Maudet, Nicolas Perny, Patrice et al.

Weitere Verfasser: Grivet Sébert, Arnaud Maudet, Nicolas Perny, Patrice et al.

Quelle: Proceedings of AAMAS 2021 ; 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021) ; https://hal.sorbonne-universite.fr/hal-03142810 ; 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2021), International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), May 2021, Online, United Kingdom. pp.1518-1520, ⟨10.5555/3463952.3464145⟩

Schlagwörter: Computational Social Choice, Preference Aggregation, Unavailable Candidate Model, Polynomial-Time Approximation Scheme, artificial intelligence, multi-agent system, Machine learning, dissatisfaction rule, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]

Geographisches Schlagwort: Online, United Kingdom

Verfügbarkeit: https://hal.sorbonne-universite.fr/hal-03142810
https://hal.sorbonne-universite.fr/hal-03142810v1/document
https://hal.sorbonne-universite.fr/hal-03142810v1/file/Rank_Aggregation_by_Dissatisfaction_Minimisation_in_the_Unavailable_Candidate_Model__AAMAS_extended_abstract_%20%281%29.pdf
https://doi.org/10.5555/3463952.3464145

Preference Aggregation in the Generalised Unavailable Candidate Model

Autoren: Grivet Sébert, Arnaud Maudet, Nicolas Perny, Patrice et al.

Weitere Verfasser: Grivet Sébert, Arnaud Maudet, Nicolas Perny, Patrice et al.

Quelle: 7th International Conference on Algorithmic Decision Theory
https://hal.sorbonne-universite.fr/hal-03384439
7th International Conference on Algorithmic Decision Theory, University of Toulouse, Nov 2021, Toulouse, France. pp.35-50, ⟨10.1007/978-3-030-87756-9_3⟩
https://www.irit.fr/ADT2021/

Schlagwörter: Computational Social Choice, Preference Aggregation, Unavailable Candidate Model, Polynomial-Time Approximation Scheme, Artificial intelligence, voting rule, dissatisfaction, scoring rule, Machine learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geographisches Schlagwort: Toulouse, France

Verfügbarkeit: https://hal.sorbonne-universite.fr/hal-03384439
https://hal.sorbonne-universite.fr/hal-03384439v1/document
https://hal.sorbonne-universite.fr/hal-03384439v1/file/paper_44%20%282%29.pdf
https://doi.org/10.1007/978-3-030-87756-9_3