Sciweavers

    NETWORKS
    2007
    90views Computer Networks» more  NETWORKS 2007»
    Vertex disjoint routings of cycles over tori
    13 years 4 months ago
    Vertex disjoint routings of cycles over tori
    Download  hal.archives-ouvertes.fr
    We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
    Jean-Claude Bermond, Min-Li Yu
    claim paper
    Read More »
    NETWORKS
    2007
    124views Computer Networks» more  NETWORKS 2007»
    Incremental flow
    13 years 4 months ago
    Incremental flow
    Download  www.cs.cornell.edu
    This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
    Jeff Hartline, Alexa Sharp
    claim paper
    Read More »
    NETWORKS
    2007
    77views Computer Networks» more  NETWORKS 2007»
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    13 years 4 months ago
    A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
    Download  www.cs.uoi.gr
    Katerina Asdre, Stavros D. Nikolopoulos
    claim paper
    Read More »
    NETWORKS
    2007
    109views Computer Networks» more  NETWORKS 2007»
    Approximability of the k-server disconnection problem
    13 years 4 months ago
    Approximability of the k-server disconnection problem
    Download  polytope.snu.ac.kr
    Sung-Pil Hong, Byung-Cheon Choi
    claim paper
    Read More »
    NETWORKS
    2007
    73views Computer Networks» more  NETWORKS 2007»
    Heuristic solutions for general concave minimum cost network flow problems
    13 years 4 months ago
    Heuristic solutions for general concave minimum cost network flow problems
    Download  www.fep.up.pt
    Dalila B. M. M. Fontes, José Fernando Gon&c...
    claim paper
    Read More »
    NETWORKS
    2007
    94views Computer Networks» more  NETWORKS 2007»
    Network design arc set with variable upper bounds
    13 years 4 months ago
    Network design arc set with variable upper bounds
    Download  www.ieor.berkeley.edu
    Alper Atamtürk, Oktay Günlük
    claim paper
    Read More »
    NETWORKS
    2007
    91views Computer Networks» more  NETWORKS 2007»
    The maximum residual flow problem: NP-hardness with two-arc destruction
    13 years 4 months ago
    The maximum residual flow problem: NP-hardness with two-arc destruction
    Download  v8nu74s71s31g374r7ssn017uloss3c1vr3s.unbf.ca
    The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
    Donglei Du, R. Chandrasekaran
    claim paper
    Read More »
    « first‹ previous12
    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.