2031 search results - page 3 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
CCE
2004
13 years 7 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
SIGCOMM
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...