Sciweavers

    833 search results - page 1 / 167
    » Simpler and better approximation algorithms for network desi...
    Sort
    View
    JACM
    2007
    103views more  JACM 2007»
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    13 years 4 months ago
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    Download  theory.stanford.edu
    Anupam Gupta, Amit Kumar, Martin Pál, Tim R...
    claim paper
    Read More »
    STOC
    2003
    ACM
    100views Algorithms» more  STOC 2003»
    Simpler and better approximation algorithms for network design
    14 years 5 months ago
    Simpler and better approximation algorithms for network design
    Download  www.cs.cornell.edu
    Anupam Gupta, Amit Kumar, Tim Roughgarden
    claim paper
    Read More »
    ESA
    2008
    Springer
    124views Algorithms» more  ESA 2008»
    Better and Simpler Approximation Algorithms for the Stable Marriage Problem
    13 years 6 months ago
    Better and Simpler Approximation Algorithms for the Stable Marriage Problem
    Download  www.cs.elte.hu
    Zoltán Király
    claim paper
    Read More »
    ORL
    2007
    47views more  ORL 2007»
    A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
    13 years 4 months ago
    A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
    Download  itcs.tsinghua.edu.cn
    We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
    David P. Williamson, Anke van Zuylen
    claim paper
    Read More »
    INFOCOM
    2012
    IEEE
    184views Communications» more  INFOCOM 2012»
    A simpler and better design of error estimating coding
    11 years 7 months ago
    A simpler and better design of error estimating coding
    Download  www.cc.gatech.edu
    —We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
    Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
    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.