1100 search results - page 64 / 220 » Approximate distance oracles |
145
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
147
Voted
SMA
2003
ACM
15 years 9 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
129
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
121
Voted
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
137
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...