2069 search results - page 142 / 414 » Linear time algorithms for Clobber |
138
Voted
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
ESA
2004
Springer
15 years 10 months ago
2004
Springer
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys...
173
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
144
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
126
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...