Výsledky vyhľadávania - (constant OR content)-factor approximation algorithm

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

Autori: Zhou, Jianqi Zhang, Zhongyi Guo, Jiong

Témy: Computer Science - Data Structures and Algorithms, text

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

A Constant-Factor Approximation Algorithm for Reconciliation k-Median

Autori: Spoerhase, Joachim Khodamoradi, Kamyar Riegel, Benedikt a ďalší

Témy: 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

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

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

Témy: Dynamic programming, Multicut, Scheduling, info:eu-repo/semantics/article

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

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

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

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2507.14089

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery

Autori: Vaezi, Arash Ghodsi, Mohammad

Témy: Computer Science - Computational Geometry, Computer Science - Computational Complexity, text

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

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

Autori: Li, Wenzheng Vondrák, Jan

Témy: Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, text

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

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

Autori: Jones, M.E.L. (Mark) Kelk, S.M. (Steven) Stougie, L. (Leen)

Zdroj: Journal of Computer and System Sciences vol. 117, pp. 165-181

Témy: Fixed parameter tractability, Maximum agreement forest, Maximum parsimony, Phylogenetics, info:eu-repo/semantics/article

URL: http://ir.cwi.nl/pub/30410

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

Autori: Dariusz Dereniowski and Izajasz Wrosz Dereniowski, Dariusz Wrosz, Izajasz

Témy: binary search, graph search, approximation algorithm, query complexity, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.42
Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)

Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm

Autori: Jones, Mark Kelk, Steven Stougie, Leen

Témy: Computer Science - Data Structures and Algorithms, text

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

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

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

Témy: Facility location problems, approximation algorithms, clustering problems, parity constraints, Data processing Computer science, InProceedings, publishedVersion

Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm

Autori: Jones, M.E.L. (Mark) Kelk, S.M. (Steven) Stougie, L. (Leen)

Zdroj: Computing Research Repository vol. abs/2004.02298

Témy: info:eu-repo/semantics/article

URL: http://ir.cwi.nl/pub/30450

A constant-factor approximation for weighted bond cover

Autori: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. a ďalší

Prispievatelia: Kim, Eun Jung Lee, Euiwoong Thilikos, Dimitrios M. a ďalší

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

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

Popis súboru: application/pdf

Prístupová URL adresa: 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 Parity-Constrained Facility Location Problems

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

Témy: Computer Science - Data Structures and Algorithms, text

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

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

Autori: Dutta, Ayan Sharma, Gokarna

Témy: Computer Science - Robotics, Computer Science - Data Structures and Algorithms, text

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

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality

Autori: Usha Mohan Sivaramakrishnan Ramani Sounaka Mishra

Zdroj: Theoretical Computer Science. 657:111-126

Predmety: Combinatorial optimization, relaxed triangle inequality, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, TSP, approximation algorithms, Approximation methods and heuristics in mathematical programming, 01 natural sciences, Approximation algorithms

Popis súboru: application/xml

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0304397516305047
https://dblp.uni-trier.de/db/journals/tcs/tcs657.html#MohanRM17
https://www.sciencedirect.com/science/article/abs/pii/S0304397516305047

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

Autori: Shahar Dobzinski Wenzheng Li Aviad Rubinstein a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2309.04656

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs

Autori: Zachary Friggstad and Ramin Mousavi Friggstad, Zachary Mousavi, Ramin

Témy: Directed Steiner tree, Combinatorial optimization, approximation algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.13
Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

Autori: Ashur, Stav Filtser, Omrit Katz, Matthew J.

Témy: Computer Science - Computational Geometry, text

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

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem

Autori: Grover, Sapna Gupta, Neelima Khuller, Samir a ďalší

Témy: Capacitated Knapsack Median, Capacitated k -Facility Location, Data processing Computer science, InProceedings, publishedVersion

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time

Autori: Batra, Jatin Garg, Naveen Kumar, Amit

Témy: Computer Science - Data Structures and Algorithms, text

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