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 speed-up techniques, e.g., use of the quadrangle inequality or properties of totally monotone matrices, can reduce this to O(kn) time but these techniques are inherently st...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fleischer, Rudolf, Golin, Mordecai J., Zhang, Yan
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!