NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
NETWORKS
2008
13 years 5 months ago
2008
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...
NETWORKS
2008
13 years 5 months ago
2008
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 ...
NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
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...
NETWORKS
2008
13 years 5 months ago
2008
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...