Sciweavers

2183 search results - page 24 / 437
» Multi-pass geometric algorithms
Sort
View
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 11 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler
DCG
2010
137views more  DCG 2010»
13 years 10 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari