{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:33:55Z","timestamp":1773275635069,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407706","type":"print"},{"value":"9783540451983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_1","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"1-13","source":"Crossref","is-referenced-by-count":43,"title":["Correlation Clustering with Partial Information"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: IEEE Symp. on Foundations of Computer Science (2002)","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"1_CR2","unstructured":"Bejerano, Y., Immorlica, N., Naor, S., Smith, M.: Location area design in cellular networks. In: International Conference on Mobile Computing and Networking (2003)"},{"key":"1_CR3","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information (unpublished manuscript)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts. In: ACM Symp. on Theory of Comp. (1992)","DOI":"10.1145\/129712.129736"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Emanuel, D., Fiat, A.: Correlation clustering \u2014 minimizing disagreements on arbitrary weighted graphs. In: European Symp. on Algorithms (2003)","DOI":"10.1007\/978-3-540-39658-1_21"},{"key":"#cr-split#-1_CR6.1","doi-asserted-by":"crossref","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: Clustering for mining in large spatial databases. KI-Journal??1 (1998);","DOI":"10.1007\/978-3-642-60243-6_1"},{"key":"#cr-split#-1_CR6.2","unstructured":"Special Issue on Data Mining. Scien. Tec. Publishing"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min(multi)cut theorems and their applications. SIAM J. Comp.\u00a025 (1996)","DOI":"10.1137\/S0097539793243016"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM\u00a033 (1986)","DOI":"10.1145\/5925.5933"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Hu, T.C.: Multicommodity network flows. Operations Research (1963)","DOI":"10.1287\/opre.11.3.344"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. In: IEEE Symp. on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a024(7) (2002)","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Klein, P.N., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: ACM Symp. on Theory of Comp. (1993)","DOI":"10.1145\/167088.167261"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM\u00a046(6) (1999)","DOI":"10.1145\/331524.331526"},{"key":"1_CR14","unstructured":"Meila, M., Heckerman, D.: An experimental comparison of several clustering and initialization methods. In: Conference on Uncertainty in Artificial Intelligence (1998)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Murtagh, F.: A survey of recent advances in hierarchical clustering algorithms. The Computer Journal\u00a026(4) (1983)","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"1_CR16","unstructured":"Procopiuc, C.M.: Clustering problems and their applications. Department of Computer Science, Duke University, http:\/\/www.cs.duke.edu\/~magda\/clustering-survey.ps.gz"},{"key":"1_CR17","unstructured":"Schulman, L.J.: Clustering for edge-cost minimization. Electronic Colloquium on Computational Complexity, ECCC 6(35) (1999)"},{"key":"1_CR18","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of document clustering techniques. In: KDD-2000 Workshop on TextMining Workshop (2000)"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90228-2","volume":"47","author":"E. Tardos","year":"1993","unstructured":"Tardos, E., Vazirani, V.V.: Improved bounds for the max-flow minmulticut ratio for planar and Kr,r-free graphs. Information Processing Letters\u00a047(2), 77\u201380 (1993)","journal-title":"Information Processing Letters"},{"key":"1_CR20","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.C., Papadimitriou, C.H.: Cutting and partitioning a graph after a fixed pattern. In: 10th Intl. Coll. on Automata, Languages, and Programming (1983)","DOI":"10.1007\/BFb0036950"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T03:04:48Z","timestamp":1637118288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}