Sciweavers

    459 search results - page 4 / 92
    » Approximation Algorithms for Buy-at-Bulk Geometric Network D...
    Sort
    View
    ALGOSENSORS
    2007
    Springer
    149views Sensor Networks» more  ALGOSENSORS 2007»
    Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
    14 years 2 months ago
    Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
    Download  algosensors2007.im.pwr.wroc.pl
    e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
    Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
    claim paper
    Read More »
    IPCO
    1993
    138views Optimization» more  IPCO 1993»
    An efficient approximation algorithm for the survivable network design problem
    13 years 10 months ago
    An efficient approximation algorithm for the survivable network design problem
    Download  www-math.mit.edu
    The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
    Harold N. Gabow, Michel X. Goemans, David P. Willi...
    claim paper
    Read More »
    FOCS
    2006
    IEEE
    146views Theoretical Computer Science» more  FOCS 2006»
    Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
    14 years 2 months ago
    Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
    Download  www.cs.uiuc.edu
    We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
    Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
    claim paper
    Read More »
    MOR
    2007
    149views more  MOR 2007»
    LP Rounding Approximation Algorithms for Stochastic Network Design
    13 years 8 months ago
    LP Rounding Approximation Algorithms for Stochastic Network Design
    Download  www.cs.cmu.edu
    Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
    Anupam Gupta, R. Ravi, Amitabh Sinha
    claim paper
    Read More »
    FOCS
    2009
    IEEE
    109views Theoretical Computer Science» more  FOCS 2009»
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    14 years 13 days ago
    An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
    Download  www.cis.upenn.edu
    Julia Chuzhoy, Sanjeev Khanna
    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.