7006 search results - page 168 / 1402 » Approximation Algorithms |
117
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
125
click to vote
AAIM
2008
Springer
15 years 5 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
132
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
141
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
102
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...