153 search results - page 11 / 31 » Near-linear approximation algorithms for geometric hitting s... |
164
click to vote
IOR
2006
15 years 6 months ago
2006
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
170
click to vote
ICCSA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
148
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
188
Voted
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
192
click to vote
STOC
2005
ACM
16 years 7 hour ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...