533 search results - page 66 / 107 » Playing games with approximation algorithms |
CAD
2004
Springer
13 years 7 months ago
2004
Springer
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...