Sciweavers

    2 search results - page 1 / 1
    » An O(k^3 log n)-Approximation Algorithm for Vertex-Connectiv...
    Sort
    View
    FOCS
    2009
    IEEE
    109views Theoretical Computer Science» more  FOCS 2009»
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    13 years 8 months ago
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    Download  www.cis.upenn.edu
    Julia Chuzhoy, Sanjeev Khanna
    claim paper
    Read More »
    FOCS
    2008
    IEEE
    140views Theoretical Computer Science» more  FOCS 2008»
    Algorithms for Single-Source Vertex Connectivity
    13 years 11 months ago
    Algorithms for Single-Source Vertex Connectivity
    Download  www.cis.upenn.edu
    In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
    Julia Chuzhoy, Sanjeev Khanna
    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-2024, USA.