Sciweavers

21 search results - page 5 / 5
» A Discrete Farkas Lemma
Sort
View
FOCS
2005
IEEE
13 years 11 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...