scientific article; zbMATH DE number 2079381

zbMath1092.68619MaRDI QIDQ4471340

Anupam Gupta, Ilan Newman, Yuri Rabinovich, Chandra Chekuri, Alistair Sinclair

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time approximation schemesNP-hard optimization problems

Mathematics Subject Classification ID

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

Related Items (5)

Bandwidth and low dimensional embedding ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ On average distortion of embedding metrics into the line ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Bandwidth and Low Dimensional Embedding

This page was built for publication: