{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:52:45Z","timestamp":1725630765060},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24983-9_19","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T00:07:20Z","timestamp":1320624440000},"page":"188-194","source":"Crossref","is-referenced-by-count":5,"title":["A 7\/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs"],"prefix":"10.1007","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E","volume":"32","author":"R. Becker","year":"1998","unstructured":"Becker, R., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks\u00a032, 115\u2013125 (1998)","journal-title":"Networks"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00224-001-0008-8","volume":"34","author":"R. Becker","year":"2001","unstructured":"Becker, R., Lari, I., Lucertini, M., Simeone, B.: A polynomial-time algorithm for max-min partitioning of ladders. Theor. Comput. Syst.\u00a034, 353\u2013374 (2001)","journal-title":"Theor. Comput. Syst."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms\u00a057, 75\u201394 (2005)","journal-title":"J. Algorithms"},{"key":"19_CR4","first-page":"177","volume":"9","author":"F. Chataigner","year":"2007","unstructured":"Chataigner, F., Salgado, L.R.B., Wakabayashi, Y.: Approximation and Inaproximability results on balanced connected partitions of graphs. Discret. Math. Theor. Comput. Sci.\u00a09, 177\u2013192 (2007)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(96)00175-5","volume":"60","author":"J. Chleb\u00edkov\u00e1","year":"1996","unstructured":"Chleb\u00edkov\u00e1, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett.\u00a060, 225\u2013230 (1996)","journal-title":"Inf. Process. Lett."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theor. Comput. Sci.\u00a02, 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034, 209\u2013221 (1987)","journal-title":"J. ACM"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning trees of a graph. Acta Math. Acad. Sci. Hunger\u00a030, 241\u2013251 (1977)","journal-title":"Acta Math. Acad. Sci. Hunger"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/322234.322236","volume":"28","author":"Y. Perl","year":"1981","unstructured":"Perl, Y., Schach, S.: Max-min tree partitioning. J. ACM\u00a028, 5\u201315 (1981)","journal-title":"J. ACM"},{"key":"19_CR10","unstructured":"West, D.B.: Introduction to Graph Theory 2001. Prentice Hall (2001)"},{"key":"19_CR11","unstructured":"Wu, B.Y.: The minimum non-separating path and the balanced connected bipartition on grid graphs, arXiv:1105.5915v1 (2011)"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T08:58:40Z","timestamp":1548493120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}