780 search results - page 1 / 156 » Cost-Sharing Approximations for h |
AIPS
2007
13 years 7 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
SIAMCOMP
2008
13 years 4 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
JACM
2007
13 years 4 months ago
2007
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...