79 search results - page 15 / 16 » LP-based Approximation Algorithms for Capacitated Facility L... |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
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. What should...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...