Sciweavers

    ESA
    2009
    Springer
    127views Algorithms» more  ESA 2009»
    Maximum Flow in Directed Planar Graphs with Vertex Capacities
    14 years 7 months ago
    Maximum Flow in Directed Planar Graphs with Vertex Capacities
    Download  www.tcs.fudan.edu.cn
    In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
    Haim Kaplan, Yahav Nussbaum
    claim paper
    Read More »
    INFOCOM
    2009
    IEEE
    146views Communications» more  INFOCOM 2009»
    Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
    14 years 7 months ago
    Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
    Download  www.public.asu.edu
    — In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
    Satyajayant Misra, Guoliang Xue, Dejun Yang
    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.