Sciweavers

Share
NETWORKS
2008
8 years 5 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
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...
NETWORKS
2008
8 years 5 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
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
NETWORKS
2008
8 years 5 months ago
Grooming for two-period optical networks
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...
NETWORKS
2008
8 years 5 months ago
F-Chord: Improved uniform routing on Chord
Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vi...
NETWORKS
2008
8 years 5 months ago
Approximation bounds for Black Hole Search problems
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
NETWORKS
2008
8 years 5 months ago
Lower bounds for two-period grooming via linear programming duality
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...
NETWORKS
2008
8 years 5 months ago
Price competition with elastic traffic
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
books