{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:54:22Z","timestamp":1743040462773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_33","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"466-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for Judicious Partition of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Tunzi","family":"Tan","sequence":"first","affiliation":[]},{"given":"Jihong","family":"Gui","sequence":"additional","affiliation":[]},{"given":"Sainan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.ejc.2015.03.015","volume":"49","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Tang, Y.C., Yan, G.Y.: On judicious partitions of hypergraphs with edges of size at most 3. Eur. J. Comb. 49, 232\u2013239 (2015)","journal-title":"Eur. J. Comb."},{"key":"33_CR3","first-page":"95","volume":"327","author":"AD Scott","year":"2005","unstructured":"Scott, A.D.: Judicious partitions and related problems. Surv. Comb. 327, 95\u2013117 (2005)","journal-title":"Surv. Comb."},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jcta.1996.2744","volume":"78","author":"B Bollob\u00e1s","year":"1997","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Judicious partitions of hypergraphs. J. Comb. Theory Ser. A 78(1), 15\u201331 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/eujc.1998.0266","volume":"21","author":"B Bollob\u00e1s","year":"2000","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Judicious partitions of 3-uniform hypergraphs. Eur. J. Comb. 21(3), 289\u2013300 (2000)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"33_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00493-012-2696-x","volume":"32","author":"J Haslegrave","year":"2012","unstructured":"Haslegrave, J.: The bollob\u00e1s-thomason conjecture for 3-uniform hypergraphs. Combinatorica 32(4), 451\u2013471 (2012)","journal-title":"Combinatorica"},{"issue":"5","key":"33_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00493-014-2916-7","volume":"34","author":"J Haslegrave","year":"2014","unstructured":"Haslegrave, J.: Judicious partitions of uniform hypergraphs. Combinatorica 34(5), 561\u2013572 (2014)","journal-title":"Combinatorica"},{"issue":"6","key":"33_CR8","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.jctb.2010.06.002","volume":"100","author":"J Ma","year":"2010","unstructured":"Ma, J., Yen, P.-L., Yu, X.: On several partitioning problems of bollob\u00e1s and scott. J. Comb. Theory Ser. B 100(6), 631\u2013649 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/jgt.10174","volume":"46","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Judicious partitions of bounded-degree graphs. J. Graph Theory 46(2), 131\u2013143 (2004)","journal-title":"J. Graph Theory"},{"key":"33_CR10","doi-asserted-by":"publisher","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, New York (2011)"},{"key":"33_CR11","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, New York (2013)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:13:46Z","timestamp":1709810026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}