Search Results - content factor approximation algorithm*

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

Authors: Zhou, Jianqi Zhang, Zhongyi Guo, Jiong

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

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

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

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

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

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

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

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

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

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

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.

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Artificial Intelligence, Computer Science - Machine Learning, 62H30, 68W25, I.5.3, G.2.1, text

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

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

Authors: Vaezi, Arash Ghodsi, Mohammad

Index Terms: Computer Science - Computational Geometry, Computer Science - Computational Complexity, text

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

On fully dynamic constant-factor approximation algorithms for clustering problems

Authors: Fichtenberger, Hendrik Henzinger, Monika Wiese, Andreas

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

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

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

Authors: Li, Wenzheng Vondrák, Jan

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

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

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

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

Authors: Dariusz Dereniowski and Izajasz Wrosz Dereniowski, Dariusz Wrosz, Izajasz

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

A (2 + ?)-Factor Approximation Algorithm for Split Vertex Deletion

Authors: Lokshtanov, Daniel Misra, Pranabendu Panolan, Fahad et al.

Index Terms: Approximation Algorithms, Graph Algorithms, Split Vertex Deletion, Data processing Computer science, InProceedings, publishedVersion

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

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

Authors: Jones, Mark Kelk, Steven Stougie, Leen

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

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

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

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

Source: Computing Research Repository vol. abs/2004.02298

Index Terms: info:eu-repo/semantics/article

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

Strengthening ties towards a highly-connected world

Authors: Matakos, A. Gionis, Aristides

Source: Data mining and knowledge discovery. 36(1):448-476

Subject Terms: Densest subgraph discovery, Link recommendations, STC, Strong triadic closure, Social networking (online), Contents deliveries, Dense sub-graphs, Dense subgraph discovery, Exposed to, Learn+, Link recommendation, Triadic closures, User engagement, Approximation algorithms

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-318407
https://doi.org/10.1007/s10618-021-00812-1

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds

Authors: Zhang, Guangyi Sarpe, Ilie Gionis, Aristides

Source: WWW 2025 - Proceedings of the ACM Web Conference. :3193-3203

Subject Terms: Ad Allocation, Approximation Algorithms, Externalities, Matching, Newsfeed Advertising

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-363994

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

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

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

Authors: Dutta, Ayan Sharma, Gokarna

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

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