{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:26:22Z","timestamp":1775258782596,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T00:00:00Z","timestamp":1540598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hong Kong RGC","award":["16207914"],"award-info":[{"award-number":["16207914"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00778-018-0526-5","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T22:14:53Z","timestamp":1540592093000},"page":"221-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A unified agent-based framework for constrained graph partitioning"],"prefix":"10.1007","volume":"28","author":[{"given":"Lefteris","family":"Ntaflos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Trimponias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5588-1026","authenticated-orcid":false,"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"526_CR1","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization, 1st edn. Wiley, Hoboken (1997)","edition":"1"},{"issue":"3","key":"526_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/1015706.1015718","volume":"23","author":"A Agarwala","year":"2004","unstructured":"Agarwala, A., Dontcheva, M., Agrawala, M., Drucker, S., Colburn, A., Curless, B., Salesin, D., Cohen, M.: Interactive digital photo-montage. ACM Trans. Graph. 23(3), 294\u2013302 (2004)","journal-title":"ACM Trans. Graph."},{"key":"526_CR3","doi-asserted-by":"crossref","unstructured":"Andrews, M., Hajiaghayi, M.T., Karloff, H., Moitra, A.: Capacitated metric labeling. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 11, SIAM, pp. 976\u2013995 (2011)","DOI":"10.1137\/1.9781611973082.76"},{"key":"526_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Sekar, S.: Approximate equilibrium and incentivizing social coordination. CoRR arXiv:1404.4718 (2014)","DOI":"10.1609\/aaai.v28i1.8789"},{"key":"526_CR5","doi-asserted-by":"crossref","unstructured":"Armenatzoglou, N., Pham, H., Ntranos, V., Papadias, D., Shahabi, C.: Real-time multi-criteria social graph partitioning: a game theoretic approach. In: SIGMOD (2015)","DOI":"10.1145\/2723372.2749450"},{"issue":"1","key":"526_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF00054836","volume":"3","author":"S Barnard","year":"1989","unstructured":"Barnard, S.: Stochastic stereo matching over scale. Int. J. Comput. Vis. 3(1), 17\u201332 (1989)","journal-title":"Int. J. Comput. Vis."},{"key":"526_CR7","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N\u2013D images. In: Proceedings of Eighth IEEE International Conference on Computer Vision, vol. 1, pp. 105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"issue":"11","key":"526_CR8","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. PAMI 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. PAMI"},{"key":"526_CR9","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: Improved approximation algorithms for multiway cut. In: Proceedings of the ACM Symposium on Theory of Computing, ACM (1998)","DOI":"10.1145\/276698.276711"},{"key":"526_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, O.: A unified framework for strong price of anarchy in clustering games. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Part II, Springer International Publishing, Lecture Notes in Computer Science, vol. 9135, pp. 601\u2013613 (2015)","DOI":"10.1007\/978-3-662-47666-6_48"},{"issue":"5","key":"526_CR11","doi-asserted-by":"publisher","first-page":"616639","DOI":"10.1145\/585265.585268","volume":"49","author":"J Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. JACM 49(5), 616639 (2002)","journal-title":"JACM"},{"key":"526_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Trans. PAMI 26, 147\u2013159 (2004)","journal-title":"IEEE Trans. PAMI"},{"key":"526_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data . Accessed May 2015"},{"key":"526_CR14","doi-asserted-by":"publisher","unstructured":"Levandoski, J.J., Sarwat, M., Eldawy, A., Mokbel, M.F.: Lars: a location-aware recommender system. In: 2012 IEEE 28th International Conference on Data Engineering, pp 450\u2013461. IEEE, Washington, DC, USA (2012). https:\/\/doi.org\/10.1109\/ICDE.2012.54","DOI":"10.1109\/ICDE.2012.54"},{"key":"526_CR15","doi-asserted-by":"publisher","unstructured":"Li, K., Lu, W., Bhagat, S., Lakshmanan, L.V., Yu, C.: On social event organization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201914, pp 1206\u20131215. ACM, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2623330.2623724","DOI":"10.1145\/2623330.2623724"},{"key":"526_CR16","doi-asserted-by":"publisher","unstructured":"Naor, J., Schwartz, R.: Balanced metric labeling. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. STOC \u201905, pp 582\u2013591. ACM, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1060590.1060676","DOI":"10.1145\/1060590.1060676"},{"key":"526_CR17","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201904, pp. 587\u2013596 (2004)"},{"key":"526_CR18","first-page":"529","volume-title":"Efficient Equilibria in Polymatrix Coordination Games","author":"M Rahn","year":"2015","unstructured":"Rahn, M., Sch\u00e4fer, G.: Efficient Equilibria in Polymatrix Coordination Games, pp. 529\u2013541. Springer, Berlin (2015)"},{"issue":"3","key":"526_CR19","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/1015706.1015720","volume":"23","author":"C Rother","year":"2004","unstructured":"Rother, C., Kolmogorov, V., Blake, A.: \u201cGrabCut\u201d-interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23(3), 309\u2013314 (2004)","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"526_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Survey: graph clustering. Comput Sci Rev 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput Sci Rev"},{"key":"526_CR21","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M Wainwright","year":"2005","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. Inf. Theory 51, 3697\u20133717 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"526_CR22","unstructured":"Yedidia, J., Freeman, W., Weiss, Y.: Generalized belief propagation. In: Advances in Neural Information Processing Systems, pp. 689\u2013695 (2000)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0526-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0526-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0526-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:04:58Z","timestamp":1775253898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0526-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,27]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0526-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,27]]},"assertion":[{"value":"13 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}