Polynomial time approximation schemes for geometric $k$-clustering

Rafail Ostrovsky and Yuval Rabani
Proc. 41st Symp. Foundations of Computer Science, IEEE, Nov 2000, pp. 349–358

Cites:

[D. Eppstein publications] [Citation database] [Documents]
Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!