Sciweavers

    17 search results - page 4 / 4
    » Perfect packings with complete graphs minus an edge
    Sort
    View
    ECCC
    2007
    147views more  ECCC 2007»
    Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
    14 years 11 months ago
    Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
    Download  www.cs.cmu.edu
    In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
    Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
    claim paper
    Read More »
    STOC
    2007
    ACM
    134views Algorithms» more  STOC 2007»
    Hardness of routing with congestion in directed graphs
    15 years 12 months ago
    Hardness of routing with congestion in directed graphs
    Download  www.cs.washington.edu
    Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
    Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
    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.