7129 search results - page 352 / 1426 » Approximation Algorithms for Treewidth |
156
click to vote
IPL
2008
15 years 4 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
131
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
163
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
196
click to vote
WG
2004
Springer
15 years 10 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
149
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...