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

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

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

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

Parameterized Constant-Factor Approximation Algorithms for Tsp

Authors: Jianqi Zhou Zhongyi Zhang Yinghui Wen et al.

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

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

On fully dynamic constant-factor approximation algorithms for clustering problems

Authors: Fichtenberger, Hendrik Henzinger, Monika Wiese, Andreas

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems

Authors: Kim, Kangsan Shin, Yongho An, Hyung-Chan et al.

Contributors: Kim, Kangsan Shin, Yongho An, Hyung-Chan et al.

Subject Terms: parity constraints, FOS: Computer and information sciences, Facility location problems, clustering problems, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, approximation algorithms, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/1907.03129
https://dblp.uni-trier.de/db/conf/isaac/isaac2020.html#KimSA20
http://arxiv-export-lb.library.cornell.edu/abs/1907.03129
https://yonsei.pure.elsevier.com/en/publications/constant-factor-approximation-algorithms-for-the-parity-constrain
https://doi.org/10.4230/LIPIcs.ISAAC.2020.21
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.21

Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem

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

Index Terms: Facility location problems, approximation algorithms, clustering problems, parity constraints, Data processing Computer science, InProceedings, publishedVersion

fast and deterministic constant factor approximation algorithms for lcs imply new circuit lower bounds

Authors: Abboud, Amir Rubinstein, Aviad Amir Abboud and Aviad Rubinstein

Contributors: Abboud, Amir Rubinstein, Aviad Amir Abboud and Aviad Rubinstein

Subject Terms: Fine-grained Complexity, ddc:004, Distributed PCP, Longest Common Subsequence, Strong Exponential Time Hypothesis

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.35

Constant factor approximation algorithms for coalition structure generation

Authors: Travis C. Service Julie A. Adams

Source: Autonomous Agents and Multi-Agent Systems. 23:1-17

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

Authors: Yoshiyuki Karuno Aleksandar Shurbevski Hiroshi Nagamochi

Source: Journal of the Operations Research Society of Japan. 55:181-191

Subject Terms: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, 7. Clean energy

Access URL: http://ci.nii.ac.jp/naid/110009517351
http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.55_03_181.pdf

Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

Authors: J. Mark Keil Jonathan Backer

Source: Information Processing Letters. 110:635-638

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

Access URL: https://www.sciencedirect.com/science/article/pii/S0020019010001341
https://dblp.uni-trier.de/db/journals/ipl/ipl110.html#BackerK10

Constant-factor approximation algorithms for identifying dynamic communities

Authors: Tanya Y. Berger-Wolf Chayant Tantipathananandh

Source: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. :827-836

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://core.ac.uk/display/21294990
http://portal.acm.org/citation.cfm?doid=1557019.1557110
https://doi.org/10.1145/1557019.1557110
https://dl.acm.org/doi/10.1145/1557019.1557110
http://compbio.cs.uic.edu/~chayant/papers/fp778-tantipathananandh.pdf
https://dblp.uni-trier.de/db/conf/kdd/kdd2009.html#TantipathananandhB09

Efficient constant factor approximation algorithms for stabbing line segments with equal disks

Authors: Kobylkin, Konstantin

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Geometry, 0102 computer and information sciences, 01 natural sciences

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

Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad

Authors: Grover, Sapna Gupta, Neelima Khuller, Samir et al.

Subject Terms: FOS: Computer and information sciences, 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, 01 natural sciences

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