{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:57:01Z","timestamp":1725796621738},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_38","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"441-452","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for the Balanced 2-Connected Bipartition Problem"],"prefix":"10.1007","author":[{"given":"Di","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press, London (1976)"},{"key":"38_CR2","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. Discrete Mathematics and Theoretical Computer Science\u00a09, 177\u2013192 (2007)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"38_CR3","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. Information Processing Letters\u00a060, 225\u2013230 (1996)","journal-title":"Information Processing Letters"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discrete Applied Mathematics\u00a010, 139\u2013153 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00265-4","volume":"181","author":"G. Galbiati","year":"1997","unstructured":"Galbiati, G., Maffioli, F., Morzenti, A.: On the approximability of some maximum spanning tree problems. Theoretical Computer Science\u00a0181(1), 107\u2013118 (1997)","journal-title":"Theoretical Computer Science"},{"key":"38_CR6","volume-title":"Computers and Intractability: A Guide to The Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to The Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"38_CR7","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"485","volume-title":"Combinatoris (Proc. Fifth Hungarian Colloq., Koszthely, 1976)","author":"E. Gy\u00f6ri","year":"1978","unstructured":"Gy\u00f6ri, E.: On division of graph to connected subgraphs. In: Combinatoris (Proc. Fifth Hungarian Colloq., Koszthely, 1976). Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a0I, 18, pp. 485\u2013494. North-Holland, Amsterdam (1978)"},{"key":"38_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":"38_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","volume":"42","author":"M. Lucertini","year":"1993","unstructured":"Lucertini, M., Perl, Y., Simeone, B.: Most uniform path partitioning and its use in image processing. Discrete Applied Math.\u00a042, 227\u2013256 (1993)","journal-title":"Discrete Applied Math."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-9473(96)00062-X","volume":"24","author":"M. Maravalle","year":"1997","unstructured":"Maravalle, M., Simeone, B., Naldini, R.: Clustering on trees. Comput. Statist. Data Anal.\u00a024, 217\u2013234 (1997)","journal-title":"Comput. Statist. Data Anal."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"1250005","DOI":"10.1142\/S179383091250005X","volume":"04","author":"B.Y. Wu","year":"2012","unstructured":"Wu, B.Y.: Fully polynomial time approximation schemes for the max-min connected partition problem on interval graphs. Discrete Math. Algorithm. Appl.\u00a004, 1250005 (2012)","journal-title":"Discrete Math. Algorithm. Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:04:33Z","timestamp":1558926273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}