Combinatorial optimization in networks with Shared Risk Link Groups
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the classical graph models: shortest paths, minimum cu...
Main Authors: | David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/1297/pdf |
Similar Items
-
Combinatorial Route to Algebra: The Art of Composition & Decomposition
by: Pawel Blasiak
Published: (2009-01-01) -
Oriented Multicast Routing Applied to Network Level Agent Search
by: Damien Magoni, et al.
Published: (2001-01-01) -
Non Unitary Random Walks
by: Philippe Jacquet
Published: (2009-01-01) -
Robust Wireless Sensor Network Deployment
by: Milan Erdelj, et al.
Published: (2016-04-01) -
Linear time recognition of P4-indifference graphs
by: Michel Habib, et al.
Published: (2001-01-01)