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

A tight local algorithm for the minimum dominating set problem in outerplanar graphs

Autoři: Bonamy, Marthe Cook, Linda Groenland, Carla a další

Přispěvatelé: Bonamy, Marthe Cook, Linda Groenland, Carla a další

Témata: constant-factor approximation algorithm, FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, Constant-factor approximation algorithm, Outerplanar graphs, LOCAL model, dominating set, 0102 computer and information sciences, 01 natural sciences, Dominating set, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2108.02697
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.13
https://summit.sfu.ca/item/31752
http://summit.sfu.ca/item/21482

Approximability of guarding weak visibility polygons

Autoři: Pritam Bhattacharya Subir Kumar Ghosh Bodhayan Roy

Zdroj: Discrete Applied Mathematics. 228:109-129

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Terrains, Art-Gallery Problems, Euclidean Shortest Path Tree, Constant Factor Approximation Algorithm, 0102 computer and information sciences, 02 engineering and technology, Theorem, Vertex Guarding, 01 natural sciences, Art Gallery Problem, 0202 electrical engineering, electronic engineering, information engineering, Visibility, Computer Science - Computational Geometry, Watchmen, Algorithms, Inapproximability

Přístupová URL adresa: http://arxiv.org/abs/1409.4621
https://www.sciencedirect.com/science/article/pii/S0166218X16306333
https://dblp.uni-trier.de/db/journals/dam/dam228.html#BhattacharyaGR17

Scenariao Reduction Revisited: Fundamental Limits and Gurarantees

Autoři: Rujeerapaiboon, Napat Schindler, Kilian Kuhn, Daniel a další

Přispěvatelé: Rujeerapaiboon, Napat Schindler, Kilian Kuhn, Daniel a další

Témata: scenario reduction, Wasserstein distance, constant-factor approximation algorithm, k-median clustering, k-means clustering, 510 Mathematik, ddc:510

Popis souboru: application/pdf

Relation: https://doi.org/10.18452/8453

Dostupnost: http://edoc.hu-berlin.de/18452/9105
https://nbn-resolving.org/urn:nbn:de:kobv:11-100244408
https://doi.org/10.18452/8453

Not all insertion methods yield constant approximate tours in the Euclidean plane

Autoři: Vineet Bafna Kirk Pruhs Bala Kalyanasundaram

Zdroj: Theoretical Computer Science. 125:345-353

Témata: constant-factor approximation algorithm, traveling salesman, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, insertion heuristic, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs125.html#BafnaKP94
http://www.sciencedirect.com/science/article/pii/0304397594902577
https://core.ac.uk/display/24349189
https://www.sciencedirect.com/science/article/abs/pii/0304397594902577

Scenariao Reduction Revisited: Fundamental Limits and Gurarantees

Autoři: Higle, Julie L. Römisch, Werner Sen, Surrajeet a další

Témata: scenario reduction, Wasserstein distance, constant-factor approximation algorithm, k-median clustering, k-means clustering, 510 Mathematik, ddc:510, book, doc-type:book

URL: http://edoc.hu-berlin.de/18452/9105