153 search results - page 24 / 31 » Near-linear approximation algorithms for geometric hitting s... |
105
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
139
Voted
CGF
2006
15 years 3 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
154
click to vote
TALG
2010
14 years 10 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
125
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
120
click to vote
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...