Sciweavers

    1259 search results - page 3 / 252
    » On Survivable Access Network Design: Complexity and Algorith...
    Sort
    View
    INFOCOM
    2009
    IEEE
    156views Communications» more  INFOCOM 2009»
    Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
    14 years 2 months ago
    Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
    Download  www.cs.ou.edu
    : Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
    Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
    claim paper
    Read More »
    STOC
    2007
    ACM
    71views Algorithms» more  STOC 2007»
    Survivable network design with degree or order constraints
    14 years 7 months ago
    Survivable network design with degree or order constraints
    Download  www.andrew.cmu.edu
    Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour...
    claim paper
    Read More »
    INFOCOM
    2007
    IEEE
    181views Communications» more  INFOCOM 2007»
    Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
    14 years 1 months ago
    Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
    Download  www.cs.technion.ac.il
    — The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
    David Amzallag, Joseph Naor, Danny Raz
    claim paper
    Read More »
    IPCO
    1993
    138views Optimization» more  IPCO 1993»
    An efficient approximation algorithm for the survivable network design problem
    13 years 8 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 »
    SWAT
    2010
    Springer
    270views Algorithms» more  SWAT 2010»
    Improved Algorithm for Degree Bounded Survivable Network Design Problem
    14 years 12 days ago
    Improved Algorithm for Degree Bounded Survivable Network Design Problem
    Download  www.optimization-online.org
    Anand Louis, Nisheeth K. Vishnoi
    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.