Sciweavers

    2 search results - page 1 / 1
    » Beating Simplex for Fractional Packing and Covering Linear P...
    Sort
    View
    72
    Voted
    FOCS
    2007
    IEEE
    120views Theoretical Computer Science» more  FOCS 2007»
    Beating Simplex for Fractional Packing and Covering Linear Programs
    15 years 1 months ago
    Beating Simplex for Fractional Packing and Covering Linear Programs
    Download  www.cs.ucr.edu
    Christos Koufogiannakis, Neal E. Young
    claim paper
    Read More »
    DC
    2011
    314views Internet Technology» more  DC 2011»
    Distributed algorithms for covering, packing and maximum weighted matching
    13 years 11 months ago
    Distributed algorithms for covering, packing and maximum weighted matching
    Download  www.cs.ucr.edu
    Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
    Christos Koufogiannakis, Neal E. Young
    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.