Sciweavers

    7 search results - page 2 / 2
    » Faster approximation schemes for fractional multicommodity f...
    Sort
    View
    WAOA
    2005
    Springer
    177views Algorithms» more  WAOA 2005»
    Approximation and Complexity of k-Splittable Flows
    13 years 11 months ago
    Approximation and Complexity of k-Splittable Flows
    Download  www.math.tu-berlin.de
    Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
    Ronald Koch, Martin Skutella, Ines Spenke
    claim paper
    Read More »
    STOC
    1999
    ACM
    132views Algorithms» more  STOC 1999»
    A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
    13 years 10 months ago
    A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
    Download  www.cs.princeton.edu
    We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
    Kevin D. Wayne
    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.