Výsledky vyhledávání - content factor approximation algorithm~

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering

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

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

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

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

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

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

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

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)

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

Autoři: Lokshtanov, Daniel Misra, Pranabendu Panolan, Fahad a další

Témata: Approximation Algorithms, Graph Algorithms, Split Vertex Deletion, Data processing Computer science, InProceedings, publishedVersion

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

Autoři: Kim, Kangsan Shin, Yongho An, Hyung-Chan

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

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

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

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

Strengthening ties towards a highly-connected world

Autoři: Matakos, A. Gionis, Aristides

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

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

Popis souboru: print

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

Autoři: Zhang, Guangyi Sarpe, Ilie Gionis, Aristides

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

Témata: Ad Allocation, Approximation Algorithms, Externalities, Matching, Newsfeed Advertising

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-363994

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

Autoři: Kim, Kangsan Shin, Yongho An, Hyung-Chan

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

Autoři: Dutta, Ayan Sharma, Gokarna

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

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 Vertex Guarding a WV-Polygon

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

Témata: Computer Science - Computational Geometry, text

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

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem

Autoři: Grover, Sapna Gupta, Neelima Khuller, Samir a další

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

Autoři: Batra, Jatin Garg, Naveen Kumar, Amit

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

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

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

Autoři: Zachary Friggstad and Ramin Mousavi Friggstad, Zachary Mousavi, Ramin

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