Competitive and Deterministic Embeddings of Virtual Networks
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 106-121
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Hardness of robust network designNetworks, 2007
- Design of trees in the hose model: The balanced caseOperations Research Letters, 2006
- Online multicast routing with bandwidth guarantees: A new approach using multicast network flowIEEE/ACM Transactions on Networking, 2003
- Algorithms for provisioning virtual private networks in the hose modelIEEE/ACM Transactions on Networking, 2002
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- Network information flowIEEE Transactions on Information Theory, 2000
- Recent results on approximating the Steiner tree problem and its generalizationsTheoretical Computer Science, 2000
- Designing Least-Cost Nonblocking Broadband NetworksJournal of Algorithms, 1997
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Competitive multicast routingWireless Networks, 1995