Fast approximations for sums of distances, clustering and the Fermat-Weber problem (2002)
Cached
Download Links
- [cg.scs.carleton.ca]
- [www.scs.carleton.ca]
- [www.scs.carleton.ca]
- DBLP
Other Repositories/Bibliography
by
Anil Maheshwari
,
Pat Morin
| Venue: | Computational Geometry: Theory and Apllications |
| Citations: | 17 - 2 self |
BibTeX
@ARTICLE{Maheshwari02fastapproximations,
author = {Anil Maheshwari and Pat Morin},
title = {Fast approximations for sums of distances, clustering and the Fermat-Weber problem},
journal = {Computational Geometry: Theory and Apllications},
year = {2002},
volume = {24},
pages = {135--146}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Carleton University
Citations
No citations identified.
