• DocumentCode
    655184
  • Title

    Non-positive Curvature and the Planar Embedding Conjecture

  • Author

    Sidiropoulos, Anastasios

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
  • fYear
    2013
  • fDate
    26-29 Oct. 2013
  • Firstpage
    177
  • Lastpage
    186
  • Abstract
    The planar embedding conjecture asserts that any planar metric admits an embedding into L1 with constant distortion. This is a well-known open problem with important algorithmic implications, and has received a lot of attention over the past two decades. Despite significant efforts, it has been verified only for some very restricted cases, while the general problem remains elusive. In this paper we make progress towards resolving this conjecture. We show that every planar metric of non-positive curvature admits a constant-distortion embedding into L1. This confirms the planar embedding conjecture for the case of non-positively curved metrics.
  • Keywords
    computational geometry; graph theory; constant distortion; constant-distortion embedding; nonpositive curvature; open problem; planar embedding conjecture; planar graph; planar metric; Computer science; Extraterrestrial measurements; Geometry; Nickel; Skeleton; Upper bound; L_1; metric embeddings; multi-commodity flows; non-positive curvature; planar embedding conjecture; planar graphs; sparsest cut;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on
  • Conference_Location
    Berkeley, CA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/FOCS.2013.27
  • Filename
    6686153