Dealing with large hidden constants
From MaRDI portal
Publication:5406254
DOI10.1145/1963190.2025382zbMath1284.05311OpenAlexW1966100573WikidataQ57013172 ScholiaQ57013172MaRDI QIDQ5406254
Siamak Tazari, Matthias Müller-Hannemann
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1963190.2025382
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Approximate Euclidean Steiner trees ⋮ Approximation algorithms for Steiner forest: An experimental study ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations ⋮ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
