{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:45:00Z","timestamp":1761057900762,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238225","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"524-533","source":"Crossref","is-referenced-by-count":57,"title":["Clustering with qualitative information"],"prefix":"10.1109","author":[{"given":"M.","family":"Charikar","sequence":"first","affiliation":[]},{"given":"V.","family":"Guruswami","sequence":"additional","affiliation":[]},{"given":"A.","family":"Wirth","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"1994","author":"papadimitriou","journal-title":"Computational Complexity","key":"13"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1145\/301250.301430"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/CCC.2002.1004334"},{"key":"3","article-title":"Correlation clustering with partial information","author":"demaine","year":"0","journal-title":"Proc of 6th APPROX 2003"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1006\/jcss.1999.1687"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"10","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"ha?stad","year":"2001","journal-title":"JACM"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1137\/S0097539793243016"},{"key":"6","first-page":"1","article-title":"Improved approximation algorithms for MAX k-CUT and MAX BISECTION","author":"frieze","year":"1995","journal-title":"Proc of 4th IPCO Volume 920 of LNCS"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1137\/S0895480195291874"},{"key":"4","article-title":"Correlation clustering - Minimizing disagreements on arbitrary weighted graphs","author":"emanuel","year":"0","journal-title":"Proc of 11th ESA 2003"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1007\/3-540-44436-X_16"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1007\/BF02523685"}],"event":{"acronym":"SFCS-03","name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238225.pdf?arnumber=1238225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:05:26Z","timestamp":1497585926000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238225","relation":{},"subject":[]}}