Optimal algorithms for approximate clustering Export

@inproceedings{citeulike:1089306, address = {New York, NY, USA}, author = {Feder, Tom\&\#225;s and Greene, Daniel}, booktitle = {STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing}, citeulike-article-id = {1089306}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=62255}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/62212.62255}, doi = {10.1145/62212.62255}, isbn = {0897912640}, keywords = {algorithms, clustering, pad}, pages = {434--444}, posted-at = {2007-02-05 20:47:49}, priority = {3}, publisher = {ACM Press}, title = {Optimal algorithms for approximate clustering}, url = {http://dx.doi.org/10.1145/62212.62255}, year = {1988} }

TY - CONF ID - citeulike:1089306 L3 - citeulike-article-id:1089306 SN - 0897912640 AD - New York, NY, USA EP - 444 TI - Optimal algorithms for approximate clustering PB - ACM Press T2 - STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing SP - 434 KW - algorithms KW - clustering KW - pad AU - Feder, Tom\&\#225;s AU - Greene, Daniel PY - 1988/// UR - http://dx.doi.org/10.1145/62212.62255 ER -