{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:40:27Z","timestamp":1737502827453,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_46","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"455-466","source":"Crossref","is-referenced-by-count":2,"title":["Pairwise Data Clustering and Applications"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James J.","family":"Mason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven R.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"46_CR1","unstructured":"P. Agarwal and C. Procopiuc, Exact and Approximation Algorithms for Clustering, Proc. of ACM-SIAM SODA, 1998."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"V. Arya, N. Garg, R. Khandekar, V. Pandit, A. Meyerson, and K. Munagala, Local Search Heuristics for k-median and Facility Location Problems, Proc. of ACM STOC, 2001, 21\u201329.","DOI":"10.1145\/380752.380755"},{"key":"46_CR3","unstructured":"J. Aslam, A. Leblanc, and C. Stein, A New Approach to Clustering, Proc. of WAE, 2000."},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Y. Bartal, M. Charikar, and D. Raz, Approximating Min-Sum k-clustering in Metric Spaces, Proc. of ACM STOC, 2001, 11\u201322.","DOI":"10.1145\/380752.380754"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"A. Ben-Dor and Z. Yakhini, Clustering Gene Expression Patterns, Proc. of ACM RECOMB, 1999, 33\u201342.","DOI":"10.1145\/299432.299448"},{"key":"46_CR6","unstructured":"D. Bienstock, January 1999. Talk at Oberwolfach, Germany."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"M. Charikar, C. Chekuri, T. Feder, and R. Motwani, Incremental Clustering and Dynamic Information Retrieval, Proc. of ACM STOC, 1997, 626\u2013635.","DOI":"10.1145\/258533.258657"},{"key":"46_CR8","unstructured":"T.H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990."},{"key":"46_CR9","unstructured":"P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, Clustering in Large Graphs and Matrices, Proc. of ACM-SIAM SODA, 1999."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1137\/S0097539796308217","volume":"28","author":"G. Even","year":"1999","unstructured":"G. Even, J. Naor, S. Rao, and B. Schieber, Fast Approximate Graph Partitioning Algorithms, SIAM J. Computing, 28(1999), 2187\u20132214.","journal-title":"SIAM J. Computing"},{"key":"46_CR11","unstructured":"B. Everitt, Cluster Analysis, Oxford University Press, 1993."},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"N. Garg and J. K\u00f6nemann, Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems, Proc. 39th IEEE FOCS, 1998, 300\u2013309.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"N. Garg, V. V. Vazirani, and M. Yannakakis, Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications, SIAM J. Computing, 25(1996), 235\u2013251.","journal-title":"SIAM J. Computing"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"S. Guattery and G. Miller, On the Performance of Spectral Graph Partitioning Methods, Proc. of ACM-SIAM SODA, 1995, 233\u2013242.","DOI":"10.21236\/ADA292214"},{"key":"46_CR15","unstructured":"S. Guha, N. Mishra, R. Motwani, and L. O\u2019Callaghan, Clustering Data Streams, Proc. of IEEE FOCS, 2000."},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/34.566806","volume":"19","author":"T. Hofmann","year":"1997","unstructured":"T. Hofmann and J. Buhmann, Pairwise Data Clustering by Deterministic Annealing, IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(1997), 1\u201314.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"R. Kannan, S. Vempala, and A. Vetta, On Clusterings \u2014 Good, Bad and Spectral, Proc. of IEEE FOCS, 2000.","DOI":"10.1109\/SFCS.2000.892125"},{"key":"46_CR18","unstructured":"G. Karakostas, Faster Approximation Schemes for Fractional Multicommodity Flow Problems, Proc. 13th ACM-SIAM SODA, 2002, 166\u2013173."},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/S0097539792241175","volume":"23","author":"P. Klein","year":"1994","unstructured":"P. Klein, S. Plotkin, C. Stein, and \u00c9. Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts, SIAM J. on Computing, 23(1994), 466\u2013487.","journal-title":"SIAM J. on Computing"},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jcss.1995.1020","volume":"50","author":"T. Leighton","year":"1995","unstructured":"T. Leighton, F. Makedon, S. Plotkin, C. Stein, \u00c9. Tardos, and S. Tragoudas, Fast Approximation Algorithms for Multicommodity Flow Problems, J. of Computer and System Sciences, 50(1995), 228\u2013243.","journal-title":"J. of Computer and System Sciences"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"T. Leighton and S. Rao, Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms, J. of the ACM, 46(1999), 787\u2013832.","journal-title":"J. of the ACM"},{"key":"46_CR22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J. Matousek","year":"2000","unstructured":"J. Matousek, On Approximate Geometric k-clustering, Discrete and Computational Geometry, 24(2000), 61\u201384.","journal-title":"Discrete and Computational Geometry"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"B. Mirkin, Mathematical Classification and Clustering, Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4613-0457-9"},{"key":"46_CR24","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"F. Shahrokhi and D. Matula, The Maximum Concurrent Flow Problem. J. of the ACM, 37(1990), 318\u2013334.","journal-title":"J. of the ACM"},{"issue":"8","key":"46_CR25","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik, Normalized Cuts and Image Segmentation, IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8) (2000), 888\u2013905.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:46Z","timestamp":1737501946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}