Sciweavers

    SODA
    2000
    ACM
    120views Algorithms» more  SODA 2000»
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
    14 years 26 days ago
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
    Download  people.commerce.ubc.ca
    This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
    S. Thomas McCormick, Akiyoshi Shioura
    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.