Sciweavers

    SODA
    2008
    ACM
    75views Algorithms» more  SODA 2008»
    Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
    14 years 2 months ago
    Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
    Download  people.commerce.ubc.ca
    Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
    S. Thomas McCormick, Satoru Fujishige
    claim paper
    Read More »
    COCOON
    2005
    Springer
    122views Combinatorics» more  COCOON 2005»
    Bicriteria Network Design via Iterative Rounding
    14 years 6 months ago
    Bicriteria Network Design via Iterative Rounding
    Download  ls2-www.cs.uni-dortmund.de
    We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
    Piotr Krysta
    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.