1632 search results - page 70 / 327 » Sublinear Time Algorithms for Metric Space Problems |
115
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
180
Voted
TASE
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
117
Voted
FOCM
2008
15 years 3 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
170
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
115
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...