Problémes de conception de réseaux
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 519-556
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problemsJournal of Computer and System Sciences, 2006
- Design of Survivable Networks: A surveyNetworks, 2005
- On the approximability of the Steiner tree problemTheoretical Computer Science, 2002
- The parsimonious property of cut covering problems and its applicationsOperations Research Letters, 1997
- Improved Approximation Algorithms for Uniform Connectivity ProblemsJournal of Algorithms, 1996
- A primal-dual approximation algorithm for generalized steiner network problemsCombinatorica, 1995
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- Biconnectivity approximations and graph carvingsJournal of the ACM, 1994
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988