328 search results - page 8 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
STOC
1999
ACM
14 years 27 days ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...