Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.05366OpenAlexW2649657569MaRDI QIDQ5479359

Kunal Talwar, Uriel Feige

Publication date: 7 July 2006

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, Hardness results for approximating the bandwidth, Labeling schemes for weighted dynamic trees, Line-distortion, bandwidth and path-length of a graph, Bandwidth of Bipartite Permutation Graphs in Polynomial Time, An Exponential Time 2-Approximation Algorithm for Bandwidth, Bandwidth of bipartite permutation graphs in polynomial time, Moderately exponential time and fixed parameter approximation algorithms