Výsledky vyhledávání - "Constant factor approximation algorithm"

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

Autoři: Zhou, Jianqi Zhang, Zhongyi Guo, Jiong

Zdroj: Lecture Notes in Computer Science ISBN: 9789819610891

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2503.00281

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

Autoři: Cohen-Addad, Vincent Kuhn, Fabian Parsaeian, Zahra

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

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

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

Autoři: Raghunath Reddy Madireddy Apurva Mudgal

Zdroj: Algorithmica. 85:100-132

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Autoři: Leen Stougie Mark Jones Steven Kelk a další

Přispěvatelé: Leen Stougie Mark Jones Steven Kelk a další

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

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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: Li, Wenzheng Vondrák, Jan

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

Témata: 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)

Přístupová URL adresa: http://arxiv.org/pdf/2103.10536
http://arxiv.org/abs/2103.10536

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

Autoři: Ayan Dutta Gokarna Sharma

Zdroj: Lecture Notes in Computer Science ISBN: 9783031271984

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/1906.11750

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

Autoři: Batra, J. (Jatin) Garg, N. (Naveen) Kumar, A. (Amit)

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

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

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

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

Autoři: Svensson, Ola Tarnawski, Jakub Végh, László A.

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

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

Přístupová URL adresa: 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 Algorithm for Binary Search in Trees with Monotonic Query Times

Autoři: Dereniowski, Dariusz Wrosz, Izajasz Dariusz Dereniowski and Izajasz Wrosz

Přispěvatelé: Dereniowski, Dariusz Wrosz, Izajasz Dariusz Dereniowski and Izajasz Wrosz

Témata: graph search, query complexity, ddc:004, binary search, approximation algorithm

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.42

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

Autoři: Apurva Mudgal Raghunath Reddy Madireddy

Zdroj: Lecture Notes in Computer Science ISBN: 9783030808785

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-030-80879-2_14
https://link.springer.com/chapter/10.1007/978-3-030-80879-2_14

A Constant-Factor Approximation Algorithm for Reconciliation k-Median

Autoři: Spoerhase, Joachim Khodamoradi, Kamyar Riegel, Benedikt a další

Témata: 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 Algorithm for Vertex Guarding a WV-Polygon

Autoři: Matthew J. Katz Stav Ashur Omrit Filtser

Zdroj: Lecture Notes in Computer Science ISBN: 9783030808785

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://jocg.org/index.php/jocg/article/download/3434/3003
http://arxiv.org/abs/1907.01228
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-01228
http://arxiv-export-lb.library.cornell.edu/abs/1907.01228
https://rd.springer.com/chapter/10.1007/978-3-030-80879-2_6
https://link.springer.com/chapter/10.1007/978-3-030-80879-2_6

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

Autoři: 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émata: Fixed parameter tractability, Maximum agreement forest, Maximum parsimony, Phylogenetics, info:eu-repo/semantics/article

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

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

Autoři: Vaezi, Arash Ghodsi, Mohammad

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

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

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

Autoři: Dariusz Dereniowski and Izajasz Wrosz Dereniowski, Dariusz Wrosz, Izajasz

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

Autoři: Jones, M.E.L. (Mark) Kelk, S.M. (Steven) Stougie, L. (Leen)

Zdroj: Computing Research Repository vol. abs/2004.02298

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

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

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

Autoři: Jones, Mark Kelk, Steven Stougie, Leen

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

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

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

Autoři: Li, Wenzheng Vondrák, Jan

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

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

Constant factor approximation algorithm for TSP satisfying a biased triangle inequality

Autoři: Usha Mohan Sivaramakrishnan Ramani Sounaka Mishra

Zdroj: Theoretical Computer Science. 657:111-126

Témata: 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 souboru: application/xml

Pří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 Algorithm for the Storage Allocation Problem

Autoři: Reuven Bar-Yehuda Dror Rawitz Michael Beder

Zdroj: Algorithmica. 77:1105-1127

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#Bar-YehudaBR17
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#Bar-YehudaBR17
https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0137-8.pdf
https://doi.org/10.1007/s00453-016-0137-8
https://link.springer.com/article/10.1007%2Fs00453-016-0137-8
https://www.eng.biu.ac.il/~rawitzd/Papers/sap.pdf