Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
From MaRDI portal
Publication:3434558
DOI10.1007/11758471_22zbMath1183.90279OpenAlexW2095717317MaRDI QIDQ3434558
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_22
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Approximating \(k\)-hop minimum spanning trees in Euclidean metrics ⋮ Low-light trees, and tight lower bounds for Euclidean spanners