Sciweavers

19 search results - page 1 / 4
» Better Bounds for Incremental Medians
Sort
View
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 4 months ago
Better Bounds for Incremental Medians
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...
Marek Chrobak, Mathilde Hurand
CCCG
2010
14 years 6 days ago
The projection median of a set of points in Rd
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...
Riddhipratim Basu, Bhaswar Bhattacharya, Tanmoy Ta...
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 5 months ago
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
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...
Marek Chrobak, Lukasz Jez, Jiri Sgall
SWAT
2004
Springer
78views Algorithms» more  SWAT 2004»
14 years 4 months ago
Online Maintenance of k-Medians and k-Covers on a Line
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...
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
12 years 1 months ago
The shifting sands algorithm
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 ...
Andrew McGregor, Paul Valiant