Highly Influential

We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization problems, previously studied by Dhamdhere et al. [9], Golovin et al. [15], and Feige et al. [13], are two-stage planning problems in which the requirements are revealed after some decisions… (More)

- Steiner tree problem
- IEEE 802.11i-2004
- Facility location problem
- exponential
- Approximation algorithm
- Network planning and design
- Approximation
- Algorithm
- Robust optimization
- Requirement
- Combinatorial optimization
- Covering problems
- Randomized algorithm
- APX
- Polynomial
- Singleton pattern
- Trees (plant)
- Mathematical optimization
- Time complexity
- Vertex
- statistical cluster
- Computer terminal