Search Results - Constant-factor approximation algorithms

From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems

Authors: Jianqi Zhou Zhongyi Zhang Yinghui Wen et al.

Source: Lecture Notes in Computer Science ISBN: 9789819502172

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center: Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center

Authors: Kangsan Kim Yongho Shin Hyung-Chan An

Source: Algorithmica. 85:1883-1911

Subject Terms: Graph theory, parity constraints, \(k\)-center, clustering problems, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, approximation algorithms, Algorithms in computer science, 01 natural sciences, facility location problems

File Description: application/xml

Access URL: https://zbmath.org/7704064
https://doi.org/10.1007/s00453-022-01060-5

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

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

Source: Doklady Mathematics. 108:499-505

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

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

Source: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). :1357-1365

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

Authors: Armbruster, Alexander Rohwedder, Lars Wiese, Andreas

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

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2308.06209

A constant-factor approximation for weighted bond cover

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

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

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

Subject Terms: 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

File Description: application/pdf

Access 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

Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem

Authors: M. Yu. Khachay E. D. Neznakhina K. V. Ryzhenko

Source: Proceedings of the Steklov Institute of Mathematics. 319:S140-S155

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

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

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

Subject Terms: 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

Access 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/

Parameterized Constant-Factor Approximation Algorithms for Tsp

Authors: Jianqi Zhou Zhongyi Zhang Yinghui Wen et al.

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.

Authors: Cohen-Addad, Vincent Das, Debarati Kipouridis, Evangelos et al.

Source: Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-41. 41p.

Subject Terms: POLYNOMIAL time algorithms, TREE graphs, APPROXIMATION algorithms

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

Authors: Nilsson, Bengt J. Packer, Eli

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

Subject Terms: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

File Description: print

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

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

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

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

Source: Algorithmica. 84:2106-2133

Subject Terms: 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

File Description: application/pdf

Access 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

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

Index Terms: 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

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds.

Authors: Fotakis, Dimitris Matuschke, Jannik Papadigenopoulos, Orestis

Source: Mathematical Programming. Jul2024, Vol. 206 Issue 1/2, p515-539. 25p.

Subject Terms: *APPROXIMATION algorithms, *SCHEDULING, *UTILITY functions, *CONCAVE functions, *PRODUCTION scheduling

Constant-Factor Approximation Algorithms for Some Maximin Multi-clustering Problems

Authors: Vladimir Khandeev Sergey Neshchadim

Source: Lecture Notes in Computer Science ISBN: 9783031353048

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

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

Index Terms: 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

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

Authors: Armbruster, Alexander Rohwedder, Lars Wiese, Andreas

Index Terms: Computer Science - Data Structures and Algorithms, text

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

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

Authors: Zachary Friggstad Chaitanya Swamy Zachary Friggstad and Chaitanya Swamy

Contributors: Zachary Friggstad Chaitanya Swamy Zachary Friggstad and Chaitanya Swamy

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

Subject Terms: 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

File Description: application/pdf

Access 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.

Authors: BATRA, JATIN GARG, NAVEEN KUMAR, AMIT

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

Subject Terms: *DYNAMIC programming, *APPROXIMATION algorithms, *COMPUTER scheduling, *JOB qualifications, *ALGORITHMS, *MACHINERY

Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering

Authors: Ghadiri, Mehrdad Singh, Mohit Vempala, Santosh S.

Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, I.5.3, G.2.1, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, 62H30, 68W25, Machine Learning (cs.LG)

Access URL: http://arxiv.org/abs/2206.11210