Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.68612OpenAlexW2649657569MaRDI QIDQ5479363

Alexander Hall, Christos H. Papadimitriou

Publication date: 7 July 2006

Full work available at URL: https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Related Items (6)

Pattern matching in doubling spaces ⋮ Approximating Gromov-Hausdorff distance in Euclidean space ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees ⋮ Unnamed Item ⋮ Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques