6315 search results - page 113 / 1263 » Approximating Solution Structure |
143
click to vote
APPROX
2010
Springer
15 years 4 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...
168
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
128
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
100
click to vote
SIAMJO
2008
15 years 2 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...