19 search results - page 1 / 4 » Better Bounds for Incremental Medians |
WAOA
2007
Springer
14 years 6 days ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
CCCG
2010
13 years 7 months ago
2010
The projection median of a finite set of points in R2 was introduced by Durocher and Kirkpatrick [5]. They proved the projection median in R2 provides a better approximation of th...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...