{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:33:32Z","timestamp":1725798812789},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_32","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T06:43:15Z","timestamp":1408171395000},"page":"382-393","source":"Crossref","is-referenced-by-count":1,"title":["From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?"],"prefix":"10.1007","author":[{"given":"Alina","family":"Ene","sequence":"first","affiliation":[]},{"given":"Huy L.","family":"Nguy\u00ea\u0303n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integration, the VLSI Journal\u00a019(1-2), 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.S., Schwartz, R.: Simplex partitioning via exponential clocks and the multiway cut problem. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 535\u2013544. ACM (2013)","DOI":"10.1145\/2488608.2488675"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Karloff, H.J., Rabani, Y.: An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences\u00a060(3), 564\u2013574 (1998); Preliminary version in STOC 1998","DOI":"10.1006\/jcss.1999.1687"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Ene, A.: Approximation algorithms for submodular multiway partition. In: FOCS, pp. 807\u2013816 (2011)","DOI":"10.1109\/FOCS.2011.34"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-22006-7_30","volume-title":"Automata, Languages and Programming","author":"C. Chekuri","year":"2011","unstructured":"Chekuri, C., Ene, A.: Submodular cost allocation problem and applications. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 354\u2013366. Springer, Heidelberg (2011)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing\u00a023(4), 864\u2013894 (1992); Preliminary version in STOC 1992","DOI":"10.1137\/S0097539792225297"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. Mathematics of Operations Research\u00a029(3), 436\u2013461 (2004); Preliminary version in STOC 1999","DOI":"10.1287\/moor.1030.0086"},{"issue":"5","key":"32_CR8","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM (JACM)\u00a049(5), 616\u2013639 (1999)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230030306","volume":"3","author":"E.L. Lawler","year":"1973","unstructured":"Lawler, E.L.: Cutsets and partitions of hypergraphs. Networks\u00a03(3), 275\u2013285 (1973)","journal-title":"Networks"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Sharma, A., Vondr\u00e1k, J.: Multiway cut, pairwise realizable distributions, and descending thresholds. In: STOC (2014)","DOI":"10.1145\/2591796.2591866"},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-004-0510-2","volume":"102","author":"L. Zhao","year":"2005","unstructured":"Zhao, L., Nagamochi, H., Ibaraki, T.: Greedy splitting algorithms for approximating multiway partition problems. Mathematical Programming\u00a0102(1), 167\u2013183 (2005)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:03:05Z","timestamp":1558958585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}