{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:12:09Z","timestamp":1768536729678,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"State Scholarship Fund of China"},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2016AM28"],"award-info":[{"award-number":["ZR2016AM28"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2015FM008"],"award-info":[{"award-number":["ZR2015FM008"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds of Shandong University","award":["2015JC006"],"award-info":[{"award-number":["2015JC006"]}]},{"name":"the hundred talent program of the Chinese Academy"},{"name":"the National Basic Research Program of China","award":["2014CB340302"],"award-info":[{"award-number":["2014CB340302"]}]},{"name":"the NSERC"},{"name":"the Grants-in-Aid for Scientific Research of Japan","award":["26330017"],"award-info":[{"award-number":["26330017"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672323"],"award-info":[{"award-number":["61672323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00453-017-0302-8","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T23:08:09Z","timestamp":1490310489000},"page":"1412-1438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems"],"prefix":"10.1007","volume":"80","author":[{"given":"Peng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Angsheng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"issue":"4","key":"302_CR1","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1137\/S1052623497323194","volume":"9","author":"KM Anstreicher","year":"1999","unstructured":"Anstreicher, K.M.: Linear programming in $$O(\\frac{n^3}{\\ln n} L)$$ O ( n 3 ln n L ) operations. SIAM J. Optim. 9(4), 803\u2013812 (1999)","journal-title":"SIAM J. Optim."},{"key":"302_CR2","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth and Brooks, Monterey (1984)"},{"key":"302_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J., Schwartz, R.: Simplex partitioning via exponential clocks and the multiway cut problem. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), pp. 535\u2013544. Palo Alto, CA, USA (2013)","DOI":"10.1145\/2488608.2488675"},{"issue":"3","key":"302_CR4","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G Calinescu","year":"2000","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci. 60(3), 564\u2013574 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"302_CR5","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"302_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"issue":"3","key":"302_CR7","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1287\/moor.1030.0086","volume":"29","author":"D Karger","year":"2004","unstructured":"Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding algorithms for a geometric embedding of minimum multiway cut. Math. Oper. Res. 29(3), 436\u2013461 (2004)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"302_CR8","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, \u00c9.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J. ACM 49(5), 616\u2013639 (2002)","journal-title":"J. ACM"},{"key":"302_CR9","doi-asserted-by":"crossref","unstructured":"Langberg, M., Rabani, Y., Swamy, C.: Approximation algorithms for graph homomorphism problems. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 176\u2013187. Barcelona, Spain (2006)","DOI":"10.1007\/11830924_18"},{"key":"302_CR10","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.physa.2014.10.082","volume":"420","author":"A Li","year":"2015","unstructured":"Li, A., Li, J., Pan, Y.: Homophyly\/kinship hypothesis: natural communities, and predicting in networks. Phys. A 420, 148\u2013163 (2015)","journal-title":"Phys. A"},{"key":"302_CR11","doi-asserted-by":"crossref","unstructured":"Sharma, A., Vondr\u00e1k, J.: Multiway cut, pairwise realizable distributions, and descending thresholds. In: Shmoys, D. (ed.) Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pp. 724\u2013733 (2014)","DOI":"10.1145\/2591796.2591866"},{"key":"302_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2003","unstructured":"Vazirani, V.: Approximation Algorithms, 2nd edn. Springer, Berlin (2003)","edition":"2"},{"key":"302_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"302_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, P., Jiang, T., Li, A.: Improved approximation algorithms for the maximum happy vertices and edges problems. In: Xu, D., Du, D., Du, D.-Z. (eds.) Proceedings of the 21th International Computing and Combinatorics Conference (COCOON), Volume 9198 of LNCS, pp. 159\u2013170 (2015)","DOI":"10.1007\/978-3-319-21398-9_13"},{"key":"302_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.tcs.2015.06.003","volume":"593","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Li, A.: Algorithmic aspects of homophyly of networks. Theor. Comput. Sci. 593, 117\u2013131 (2015)","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0302-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0302-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0302-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:05:49Z","timestamp":1568937949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0302-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0302-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,23]]}}}