Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair  Home/Search
Context
Related
| berkeley.edu/~sinclair/halin.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~sinclair/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion, and hence also embedded into ` 1 with constant distortion. These graphs play a central role in polynomial time approximation schemes for many NP-hard optimization problems on general planar graphs, and include the family of weighted k n planar grids. (Update)
Active bibliography (related documents): More All
0.5: A Tight Bound on Approximating Arbitrary Metrics by Tree.. - Fakcharoenphol, Rao.. (2003) (Correct)
0.5: The Optimal Linear Arrangement Problem: Algorithms And.. - Horton (1997) (Correct)
0.4: Cuts, Trees and l 1 -Embeddings of Graphs - Gupta, Newman, Rabinovich.. (Correct)
Similar documents based on text: More All
0.3: Quadratic Dynamical Systems (Preliminary Version) - Rabinovich, Sinclair, Wigderson (1992) (Correct)
0.3: A Computational View of Population Genetics (preliminary.. - Rabani, Rabinovich.. (1995) (Correct)
0.2: On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows - Hajiaghayi, Leighton (2003) (Correct)
BibTeX entry: (Update)
@misc{ chekuri-embedding,
author = "Chandra Chekuri and Anupam Gupta and Ilan Newman and Yuri Rabinovich and
Alistair Sinclair",
title = "Embedding k-Outerplanar Graphs into l1",
url = "citeseer.ist.psu.edu/658930.html" }
Citations (may not include all citations):170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
168 Introduction to graph theory (context) - West - 1996
151 Probabilistic approximations of metric spaces and its algori.. - Bartal - 1996
149 Approximation algorithms for NP-complete problems on planar .. (context) - Baker - 1994
127 arboretum of graphs with bounded treewidth (context) - Bodlaender, k- - 1998
93 On approximating arbitrary metrics by tree metrics - Bartal - 1998
85 The maximum concurrent flow problem (context) - Shahrokhi, Matula - 1990
66 On Lipschitz embeddings of finite metric spaces in Hilbert s.. (context) - Bourgain - 1985
53 Multicommodity flows in planar graphs (context) - Okamura, Seymour - 1981
44 Rounding via trees: deterministic approximation algorithms f.. - Charikar, Chekuri et al. - 1998
42 approximate min-cut max-flow theorem and approximation algor.. - Aumann, Rabani et al. - 1998
38 Towards a syntactic characterization of PTAS - Khanna, Motwani - 1996
37 A polylogarithmic approximation algorithm for the group Stei.. - Garg, Konjevod et al. - 2000
36 Buy-at-bulk network design - Awerbuch, Azar - 1997
34 Planar tree-width (context) - Robertson, Seymour - 1984
29 Cut problems and their application to divide-and-conquer - Shmoys - 1997
25 Small distortion and volume preserving embeddings for planar.. (context) - Rao - 1999
22 A graph-theoretic game and its applications to the k- server.. - Alon, Karp et al. - 1995
22 Approximating a finite metric by a small number of tree metr.. - Charikar, Chekuri et al. - 1998
20 Lectures in Discrete Geometry (context) - Matousek
15 competitive algorithm for the circle (context) - Karp, k- - 1989
14 and cuts -- a survey (context) - Frank, circuits - 1990
14 Springer-Verlag (context) - Diestel - 1997
14 Homotopic routing methods (context) - Schrijver - 1990
8 Algorithmic aspects of geometric embeddings (context) - Indyk - 2001
8 A lower bound on the distortion of embedding planar metrics .. (context) - Newman, Rabinovich - 2002
6 Geometry of Cuts and Metrics (context) - Deza, Laurent - 1997
6 the complexity of embedding planar graphs to minimize certai.. (context) - Bienstock, Monma - 1990
2 Studies on minimally n-connected graphs (context) - Halin - 1969
1 and Alistair Sinclair (context) - Gupta, Newman et al. - 1999
1 Syslo and Andrzej Proskurowski (context) - Sysl, On et al. - 1981
1 Steiner nodes in tree metrics don't (context) - Gupta - 2001
1 and Michael Saks (context) - Newman, Rabinovich
Documents on the same site (http://www.cs.berkeley.edu/~sinclair/): More
Approximating the Number of Monomer-Dimer Coverings of a.. - Kenyon, Randall, Sinclair (1996) (Correct)
Polynomial-time approximation algorithms for the Ising model - Jerrum, Sinclair (1993) (Correct)
Quadratic Dynamical Systems (Preliminary Version) - Rabinovich, Sinclair, Wigderson (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC