Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Designing least-cost nonblocking broadband networks
Journal of Algorithms
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On-line routing in all-optical networks
Theoretical Computer Science
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Networks new economical virtual private
Communications of the ACM - E-services: a cornucopia of digital offerings ushers in the next Net-based evolution
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Hardness of Buy-at-Bulk Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding effective support-tree preconditioners
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Provisioning virtual private networks under traffic uncertainty
Networks - Special Issue on Multicommodity Flows and Network Design
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of robust network design
Networks
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics
New Approaches for Virtual Private Network Design
SIAM Journal on Computing
Design of trees in the hose model: The balanced case
Operations Research Letters
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
More adaptive robust stable routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Approximability of robust network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Computers and Operations Research
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Static and dynamic routing under disjoint dominant extreme demands
Operations Research Letters
Models and algorithms for robust network design with several traffic scenarios
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On max-min fair flow optimization in wireless mesh networks
Ad Hoc Networks
| Hi-index | 0.00 |
A new class of network design problems were introduced by Fingerhut et al. [26], and independently by Duffield et al. [20], to address, among other things, the issue of uncertainty in the demand matrix. The so-called hose model (the term was coined in [20]) for demand matrices from [26, 20] was subsequently generalized to the polyhedral model by Ben-Ameur and Kerivin [11, 10]. In a different direction, Räacke [51] showed the existence of good randomized oblivious routings in all undirected graphs. This was followed by a proof of the polynomial time solvability of an optimal oblivious routing scheme [7]. One can view the above developments in a common framework of robust optimization. We give a survey of these developments and related work with the aim of providing a unified picture. We also highlight the remaining open problems.