Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension

doi:10.1145/2000807.2000811

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension

Full Text:

PDF

Buy this Article

Authors:	Sergio Cabello	University of Ljubljana and IMFM, Slovenia
	Panos Giannopoulos	Humboldt-Universität zu Berlin, Germany
	Christian Knauer	Freie Universität Berlin, Germany
	Dániel Marx	Budapest University of Technology and Economics, Hungary
	Günter Rote	Freie Universität Berlin, Germany

	2011 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 19 · Downloads (12 Months): 112 · Citation Count: 0

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 7 Issue 4, September 2011 ACM New York, NY, USA table of contents doi>10.1145/2000807.2000811

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms clustering complexity dimension fixed-parameter tractability lower bound nonnumerical algorithms and problems theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player