Sciweavers

    NETWORKS
    2008
    127views Computer Networks» more  NETWORKS 2008»
    Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
    14 years 21 days ago
    Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
    Download  www.isima.fr
    Maurício C. de Souza, Philippe Mahey, Berna...
    claim paper
    Read More »
    NETWORKS
    2008
    104views Computer Networks» more  NETWORKS 2008»
    Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
    14 years 21 days ago
    Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
    Download  www.ulb.ac.be
    Julie Christophe, Sophie Dewez, Jean-Paul Doignon,...
    claim paper
    Read More »
    NETWORKS
    2008
    131views Computer Networks» more  NETWORKS 2008»
    Lagrangian relaxation and enumeration for solving constrained shortest-path problems
    14 years 21 days ago
    Lagrangian relaxation and enumeration for solving constrained shortest-path problems
    Download  www.nps.navy.mil
    Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
    W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
    claim paper
    Read More »
    NETWORKS
    2008
    130views Computer Networks» more  NETWORKS 2008»
    A linear programming approach to increasing the weight of all minimum spanning trees
    14 years 21 days ago
    A linear programming approach to increasing the weight of all minimum spanning trees
    Download  www.optimization-online.org
    Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
    Mourad Baïou, Francisco Barahona
    claim paper
    Read More »
    NETWORKS
    2008
    129views Computer Networks» more  NETWORKS 2008»
    Grooming for two-period optical networks
    14 years 21 days ago
    Grooming for two-period optical networks
    Download  www.dmi.unict.it
    Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
    Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
    claim paper
    Read More »
    NETWORKS
    2008
    108views Computer Networks» more  NETWORKS 2008»
    F-Chord: Improved uniform routing on Chord
    14 years 21 days ago
    F-Chord: Improved uniform routing on Chord
    Download  isis.dia.unisa.it
    Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vi...
    claim paper
    Read More »
    NETWORKS
    2008
    142views Computer Networks» more  NETWORKS 2008»
    Approximation bounds for Black Hole Search problems
    14 years 21 days ago
    Approximation bounds for Black Hole Search problems
    Download  hal.archives-ouvertes.fr
    Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
    claim paper
    Read More »
    NETWORKS
    2008
    208views Computer Networks» more  NETWORKS 2008»
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    14 years 21 days ago
    Competitive algorithms and lower bounds for online randomized call control in cellular networks
    Download  www.ceid.upatras.gr
    Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
    claim paper
    Read More »
    NETWORKS
    2008
    146views Computer Networks» more  NETWORKS 2008»
    Lower bounds for two-period grooming via linear programming duality
    14 years 21 days ago
    Lower bounds for two-period grooming via linear programming duality
    Download  www.dmi.unict.it
    In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
    Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
    claim paper
    Read More »
    NETWORKS
    2008
    132views Computer Networks» more  NETWORKS 2008»
    Price competition with elastic traffic
    14 years 21 days ago
    Price competition with elastic traffic
    Download  web.mit.edu
    In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...
    Asuman E. Ozdaglar
    claim paper
    Read More »
    123next ›last »
    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.