Sciweavers

2 search results - page 1 / 1
» The k-Client Problem
Sort
View
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
13 years 6 months ago
The k-Client Problem
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut...
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 6 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...