Suchergebnisse - Constant-factor approximation algorithm

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

Autoren: Zhou, Jianqi Zhang, Zhongyi Guo, Jiong

Quelle: Lecture Notes in Computer Science ISBN: 9789819610891

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/abs/2503.00281

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem

Autoren: Cohen-Addad, Vincent Kuhn, Fabian Parsaeian, Zahra

Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/abs/2507.14089

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm

Autoren: Armbruster, Alexander Rohwedder, Lars Wiese, Andreas

Quelle: 2024 Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977936

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/abs/2308.06209

Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm: A linear kernel and constant factor approximation algorithm

Autoren: Leen Stougie Mark Jones Steven Kelk et al.

Weitere Verfasser: Leen Stougie Mark Jones Steven Kelk et al.

Quelle: Journal of Computer and System Sciences. 117:165-181

Schlagwörter: Maximum agreement forest, FOS: Computer and information sciences, COMPLEXITY, 0102 computer and information sciences, [INFO] Computer Science [cs], COMPATIBILITY, 01 natural sciences, [SDV] Life Sciences [q-bio], Phylogenetics, Computer Science - Data Structures and Algorithms, Fixed parameter tractability, Data Structures and Algorithms (cs.DS), Maximum parsimony, AGREEMENT FOREST

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2004.02298
https://hdl.handle.net/1871.1/0522f5f0-ab66-4220-84ab-f66b5b6df576
https://doi.org/10.1016/j.jcss.2020.10.003
https://research.vu.nl/en/publications/0522f5f0-ab66-4220-84ab-f66b5b6df576
https://cris.maastrichtuniversity.nl/en/publications/d9294f35-8b17-42ce-a4db-36cabf9c7d63
https://doi.org/10.1016/j.jcss.2020.10.003
https://inria.hal.science/hal-03498430v1
https://doi.org/10.1016/j.jcss.2020.10.003
https://inria.hal.science/hal-03498430v1/document
https://ir.cwi.nl/pub/30410
https://repository.tudelft.nl/islandora/object/uuid%3A8d5fc924-a45d-4472-a20c-54d511c45632/datastream/OBJ/download
https://research.tudelft.nl/en/publications/maximum-parsimony-distance-on-phylogenetic-trees-a-linear-kernel-
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A30410
https://research.vu.nl/en/publications/maximum-parsimony-distance-on-phylogenetic-trees-a-linear-kernel-
https://ir.cwi.nl/pub/30410/30410.pdf
http://resolver.tudelft.nl/uuid:8d5fc924-a45d-4472-a20c-54d511c45632

A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations

Autoren: Li, Wenzheng Vondrák, Jan

Quelle: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). :25-36

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, 1. No poverty, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science and Game Theory (cs.GT)

Zugangs-URL: http://arxiv.org/pdf/2103.10536
http://arxiv.org/abs/2103.10536

A constant-factor approximation for weighted bond cover

Autoren: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. et al.

Weitere Verfasser: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. et al.

Quelle: Journal of Computer and System Sciences. 149:103617

Schlagwörter: FOS: Computer and information sciences, F.2.2, G.2.2, Graph minors, 0102 computer and information sciences, 01 natural sciences, Constant-factor approximation algorithms, Primal-dual method, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Graph modification problems, Bonds in graphs, 05C35, 05C83, 05C85, 68R10, 68W25

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/opus/volltexte/2021/14700/
https://drops.dagstuhl.de/opus/volltexte/2021/14700/pdf/LIPIcs-APPROX7.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-00857
https://arxiv.org/abs/2105.00857
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.7

A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint

Autoren: Ayan Dutta Gokarna Sharma

Quelle: Lecture Notes in Computer Science ISBN: 9783031271984

Schlagwörter: FOS: Computer and information sciences, Computer Science - Robotics, 0209 industrial biotechnology, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 02 engineering and technology, Robotics (cs.RO)

Zugangs-URL: http://arxiv.org/abs/1906.11750

A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations

Autoren: Shahar Dobzinski Wenzheng Li Aviad Rubinstein et al.

Quelle: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :467-478

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, 1. No poverty, Data Structures and Algorithms (cs.DS), F.2.2, 10. No inequality, Computer Science and Game Theory (cs.GT)

Zugangs-URL: http://arxiv.org/abs/2309.04656

A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks

Autoren: Raghunath Reddy Madireddy Apurva Mudgal

Quelle: Algorithmica. 85:100-132

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times

Autoren: Dereniowski, Dariusz Wrosz, Izajasz Dariusz Dereniowski and Izajasz Wrosz

Weitere Verfasser: Dereniowski, Dariusz Wrosz, Izajasz Dariusz Dereniowski and Izajasz Wrosz

Schlagwörter: graph search, query complexity, ddc:004, binary search, approximation algorithm

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.42

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Autoren: Svensson, Ola Tarnawski, Jakub Végh, László A.

Quelle: Journal of the ACM
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing -STOC 2018

Schlagwörter: asymmetric traveling salesman problem, FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, combinatorial optimization, linear programming, Data Structures and Algorithms (cs.DS), approximation algorithms

Zugangs-URL: http://eprints.lse.ac.uk/106582/1/ATSP.pdf
http://arxiv.org/abs/1708.04215
http://doi.org/10.1145/3424306
https://dl.acm.org/doi/10.1145/3424306
https://dblp.uni-trier.de/db/journals/jacm/jacm67.html#SvenssonTV20
https://doi.org/10.1145/3424306
https://arxiv.org/pdf/1708.04215
https://ui.adsabs.harvard.edu/abs/2017arXiv170804215S/abstract
https://arxiv.org/abs/1708.04215
https://arxiv.org/pdf/1708.04215.pdf
https://dl.acm.org/doi/pdf/10.1145/3188745.3188824
https://dl.acm.org/citation.cfm?id=3188824
https://dblp.uni-trier.de/db/journals/corr/corr1708.html#abs-1708-04215
https://arxiv.org/abs/1708.04215
https://doi.org/10.1145/3188745.3188824
http://eprints.lse.ac.uk/106582/

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center.

Autoren: Kim, Kangsan Shin, Yongho An, Hyung-Chan

Quelle: Algorithmica. Jul2023, Vol. 85 Issue 7, p1883-1911. 29p.

Schlagwörter: *APPROXIMATION algorithms, *LOCATION problems (Programming), *GRAPH algorithms, *COMBINATORIAL optimization, *ASSIGNMENT problems (Programming), *APPROXIMATION theory, *COMBINATORICS

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Autoren: Nilsson, Bengt J. Packer, Eli

Quelle: Algorithmica. 86(9):2845-2884

Schlagwörter: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69948
https://doi.org/10.1007/s00453-024-01245-0

Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems.

Autoren: Neznakhina, E. D. Ogorodnikov, Yu. Yu. Rizhenko, K. V. et al.

Quelle: Doklady Mathematics. Dec2023, Vol. 108 Issue 3, p499-505. 7p.

Schlagwörter: *APPROXIMATION algorithms, *TRAVELING salesman problem, *VEHICLE routing problem

Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion

Autoren: Jungho Ahn Eun Jung Kim Euiwoong Lee et al.

Weitere Verfasser: Jungho Ahn Eun Jung Kim Euiwoong Lee et al.

Quelle: Algorithmica. 84:2106-2133

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), ptolemaic, linear programming, feedback vertex set, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Recherche opérationnelle, approximation algorithm, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2009.00809
https://drops.dagstuhl.de/opus/volltexte/2020/13406/
https://drops.dagstuhl.de/opus/volltexte/2020/13406/pdf/LIPIcs-ISAAC-2020-62.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-00809
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-00809
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.62

A Constant-Factor Approximation Algorithm for Reconciliation k-Median

Autoren: Spoerhase, Joachim Khodamoradi, Kamyar Riegel, Benedikt et al.

Index Begriffe: Computer Sciences, Datavetenskap (datalogi), Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-334434
Proceedings of the 26th International Conference on Artificial Intelligence and Statistics, AISTATS 2023, p. 1719-1746

Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time

Autoren: Batra, J. (Jatin) Garg, N. (Naveen) Kumar, A. (Amit)

Quelle: SIAM Journal on Computing vol. 52 no. 6, pp. FOCS18158-FOCS18188

Index Begriffe: Dynamic programming, Multicut, Scheduling, info:eu-repo/semantics/article

URL: https://ir.cwi.nl/pub/33883

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon

Autoren: Browne, Reilly Kasthurirangan, Prahlad Narasimham Mitchell, Joseph S. B. et al.

Index Begriffe: Computer Sciences, Datavetenskap (datalogi), Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-201202
Annual IEEE Symposium on Foundations of Computer Science, 0272-5428
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, p. 1357-1365

A constant-factor approximation for directed latency in quasi-polynomial time

Autoren: Zachary Friggstad Chaitanya Swamy Zachary Friggstad and Chaitanya Swamy

Weitere Verfasser: Zachary Friggstad Chaitanya Swamy Zachary Friggstad and Chaitanya Swamy

Quelle: Journal of Computer and System Sciences. 126:44-58

Schlagwörter: FOS: Computer and information sciences, Directed Latency, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, Approximation Algorithms, TSP, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2020/12918/pdf/LIPIcs-ESA-2020-52.pdf
http://arxiv.org/abs/1912.06198
https://arxiv.org/abs/1912.06198
https://dblp.uni-trier.de/db/journals/corr/corr1912.html#abs-1912-06198
http://arxiv.org/pdf/1912.06198.pdf
https://drops.dagstuhl.de/opus/volltexte/2020/12918/pdf/LIPIcs-ESA-2020-52.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12918/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.52

CONSTANT FACTOR APPROXIMATION ALGORITHM FOR WEIGHTED FLOW-TIME ON A SINGLE MACHINE IN PSEUDOPOLYNOMIAL TIME.

Autoren: BATRA, JATIN GARG, NAVEEN KUMAR, AMIT

Quelle: SIAM Journal on Computing. 2023, Vol. 52 Issue 6, p1-31. 31p.

Schlagwörter: *DYNAMIC programming, *APPROXIMATION algorithms, *COMPUTER scheduling, *JOB qualifications, *ALGORITHMS, *MACHINERY