509 search results - page 86 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
139
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
103
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
144
Voted
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
120
Voted
IM
2006
15 years 3 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...