Sciweavers

    280 search results - page 3 / 56
    » Distributed Approximation Algorithms for Planar Graphs
    Sort
    View
    COMPGEOM
    2006
    ACM
    163views Discrete Geometry» more  COMPGEOM 2006»
    Plane embeddings of planar graph metrics
    15 years 3 months ago
    Plane embeddings of planar graph metrics
    Download  www-math.mit.edu
    Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
    MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
    claim paper
    Read More »
    IPL
    2007
    81views more  IPL 2007»
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    14 years 9 months ago
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    Download  www.csm.lau.edu.lb
    The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
    Faisal N. Abu-Khzam, Michael A. Langston
    claim paper
    Read More »
    DMTCS
    2006
    79views Mathematics» more  DMTCS 2006»
    Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
    14 years 9 months ago
    Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
    Download  www.dmtcs.org
    Mustapha Kchikech, Olivier Togni
    claim paper
    Read More »
    ICALP
    2009
    Springer
    138views Programming Languages» more  ICALP 2009»
    Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
    15 years 10 months ago
    Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
    Download  www-math.mit.edu
    We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
    Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
    claim paper
    Read More »
    STOC
    2003
    ACM
    119views Algorithms» more  STOC 2003»
    Constant factor approximation of vertex-cuts in planar graphs
    15 years 10 months ago
    Constant factor approximation of vertex-cuts in planar graphs
    Download  faculty.cs.tamu.edu
    Eyal Amir, Robert Krauthgamer, Satish Rao
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.