Fetching the paper…
Reading the bibliography…
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today.
An analysis of approximations for maximizing submodular set functions II
M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions I
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher · 1978
Earlier work this paper cites.
Dynamic Steiner tree problem
M. Imase and B.M. Waxman · 1991
Earlier work this paper cites.
When trees collide : An approximation algorithm for the generalized Steiner problem on networks
Ajit Agrawal, Philip Klein, and R. Ravi · 1995
Earlier work this paper cites.
A General Approximation Technique for Constrained Forest Problems
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Randomized Algorithms
R. Motwani and P. Raghavan · 1995
Earlier work this paper cites.
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis · 1996
Earlier work this paper cites.
On-line algorithms for Steiner tree problems
Piotr Berman and Chris Coulston · 1997
Earlier work this paper cites.
Improved performance of the greedy algorithm for partial cover
Petr Slavík · 1997
Earlier work this paper cites.
Combinatorial Optimization
W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver · 1998
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
The Online Set Cover Problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Seffi Naor · 2003
Earlier work this paper cites.
A polynomial-time tree decomposition to minimize congestion
Chris Harrelson, Kirsten Hildrum, and Satish Rao · 2003
Earlier work this paper cites.
Combinatorial Optimization
A. Schrijver · 2003
Cited alongside, same era.
A General Approach to Online Network Optimization Problems
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Seffi Naor · 2004
Cited alongside, same era.
The all-or-nothing multicommodity flow problem
Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd · 2004
Cited alongside, same era.
A tight bound on approximating arbitrary metrics by tree metrics
Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar · 2004
Cited alongside, same era.
Approximation algorithms for partial covering problems
Rajiv Gandhi, Samir Khuller, and Aravind Srinivasan · 2004
Cited alongside, same era.
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems
Nicole Immorlica, David Karger, Maria Minkoff, and Vahab S. Mirrokni · 2004
Pay today for a rainy day: improved approximation algorithms for demand-robust min-cut and shortest path problems
Daniel Golovin, Vineet Goyal, and R. Ravi · 2006
Later among the works it cites.
Approximating the k-multicut problem
Daniel Golovin, Viswanath Nagarajan, and Mohit Singh · 2006
Later among the works it cites.
Maximizing a monotone submodular function under a matroid constraint
G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák · 2007
Later among the works it cites.
Robust combinatorial optimization with exponential scenarios
Uriel Feige, Kamal Jain, Mohammad Mahdian, and Vahab S. Mirrokni · 2007
Later among the works it cites.
Dial a ride from k-forest
A. Gupta, M. T. Hajiaghayi, V. Nagarajan, and R. Ravi · 2007
Later among the works it cites.
Two-stage robust network design with exponential scenarios
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, and Mohammad R. Salavatipour · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Hedging uncertainty: approximation algorithms for stochastic optimization problems
R. Ravi and A. Sinha · 2004
Cited alongside, same era.
Stochastic Optimization is (almost) as Easy as Deterministic Optimization
D. Shmoys and C. Swamy · 2004
Cited alongside, same era.
A note on maximizing a submodular set function subject to knapsack constraint
M. Sviridenko · 2004
Cited alongside, same era.
Multicommodity flow, well-linked terminals, and routing problems
Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd · 2005
Cited alongside, same era.
How to pay, come what may: Approximation algorithms for demand-robust covering problems
Kedar Dhamdhere, Vineet Goyal, R. Ravi, and Mohit Singh · 2005
Cited alongside, same era.
Saving an epsilon: a 2-approximation for the k-mst problem in graphs
Naveen Garg · 2005
Cited alongside, same era.
Later among the works it cites.
Optimal hierarchical decompositions for congestion minimization in networks
Harald Räcke · 2008
Later among the works it cites.
C. Swamy · 2008
Later among the works it cites.
Optimal approximation for the submodular welfare problem in the value oracle model
J. Vondrák · 2008
Later among the works it cites.
Correlation Robust Stochastic Optimization
Shipra Agrawal, Yichuan Ding, Amin Saberi, and Yinyu Ye · 2009
Closest in time.
An improved lp-based approximation for steiner tree
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, and Laura Sanità · 2010
Closest in time.
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
Anupam Gupta, Viswanath Nagarajan, and R. Ravi · 2010
Closest in time.