Sciweavers

    654 search results - page 2 / 131
    » An efficient approximation algorithm for the survivable netw...
    Sort
    View
    COCOON
    2005
    Springer
    122views Combinatorics» more  COCOON 2005»
    Bicriteria Network Design via Iterative Rounding
    13 years 11 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 »
    DISOPT
    2008
    107views more  DISOPT 2008»
    The k-path tree matroid and its applications to survivable network design
    13 years 5 months ago
    The k-path tree matroid and its applications to survivable network design
    Download  www.ams.sunysb.edu
    We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
    Esther M. Arkin, Refael Hassin
    claim paper
    Read More »
    APPROX
    2008
    Springer
    134views Algorithms» more  APPROX 2008»
    Inapproximability of Survivable Networks
    13 years 7 months ago
    Inapproximability of Survivable Networks
    Download  www.openu.ac.il
    In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
    Yuval Lando, Zeev Nutov
    claim paper
    Read More »
    HIS
    2009
    160views Information Technology» more  HIS 2009»
    A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
    13 years 3 months ago
    A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
    Download  www.ads.tuwien.ac.at
    Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
    Bin Hu, Günther R. Raidl
    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
    13 years 9 months 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.