scientific article; zbMATH DE number 2079381
From MaRDI portal
Publication:4471340
zbMATH Open1092.68619MaRDI QIDQ4471340FDOQ4471340
Authors: Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
- Embedding k-Outerplanar Graphs into l1
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
Cited In (16)
- Title not available (Why is that?)
- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
- Embedding planar graphs into low-treewidth graphs with applications to efficient approximation schemes for metric problems
- A tight bound on approximating arbitrary metrics by tree metrics
- On average distortion of embedding metrics into the line
- Title not available (Why is that?)
- Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Embedding k-Outerplanar Graphs into l1
- On triangulating \(k\)-outerplanar graphs
- Bandwidth and low dimensional embedding
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- Clin d'oeil on \(L_1\)-embeddable planar graphs
- On the 2-sum embedding conjecture
- Bandwidth and low dimensional embedding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471340)
