19 search results - page 2 / 4 » aaim 2008 |
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
AAIM
2008
Springer
13 years 6 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.
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...