Fast Approximation in Subspaces by Doubling Metric Decomposition

DOI10.1007/978-3-642-15775-2_7zbMath1287.68179OpenAlexW1579506396MaRDI QIDQ3586452

Marcin Mucha, Piotr Sankowski, Marcin Pilipczuk, Łukasz Kowalik, Marek Cygan

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25)

Related Items (1)

On random perfect matchings in metric spaces with not-too-large diameters

This page was built for publication: Fast Approximation in Subspaces by Doubling Metric Decomposition