2010
DOI: 10.1007/978-3-642-11476-2_9
View full text
|
Sign up to set email alerts
|
Share

Abstract: In classic optimization theory, the concept of stability refers to the study of how much and in which way the optimal solutions of a given minimization problem Π can vary as a function of small perturbations of the input data. Motivated by congestion problems arising in shortest-path based communication networks, in this paper we restrict ourselves to the case in which Π is actually a network design problem on a given graph G = (V,E,w) of |V| = n nodes, |E| = m edges, and with a positive real weight w(e) on ea…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
1
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals