{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T05:49:59Z","timestamp":1715924999301},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T00:00:00Z","timestamp":1357171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10898-012-0028-8","type":"journal-article","created":{"date-parts":[[2013,1,2]],"date-time":"2013-01-02T08:38:37Z","timestamp":1357115917000},"page":"1263-1275","source":"Crossref","is-referenced-by-count":5,"title":["Max-min weight balanced connected partition"],"prefix":"10.1007","volume":"57","author":[{"given":"Lele","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Lidan","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,3]]},"reference":[{"key":"28_CR1","unstructured":"Alimonti, P., Calamoneri, T.: On the complexity of the max balance problem. In: Argentinian Workshop on, Theoretical Computer Science (WAIT\u201999) (1999) 133\u2013138"},{"key":"28_CR2","doi-asserted-by":"crossref","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 32, 115\u2013125 (1998)","journal-title":"Networks"},{"key":"28_CR3","doi-asserted-by":"crossref","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. Theory Comput. Syst. 34, 353\u2013374 (2001)","journal-title":"Theory Comput. Syst."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1080\/00207160212707","volume":"79","author":"D Bera","year":"2002","unstructured":"Bera, D., Pal, M., Pal, T.K.: An efficient algorithm to generate all maximal cliques on trapezoid graphs. Int. J. Comput. Math. 79, 1057\u20131065 (2002)","journal-title":"Int. J. Comput. Math."},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, p. 222. Springer, New York (2008)"},{"key":"28_CR6","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. 9, 177\u2013192 (2007)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(94)00158-A","volume":"66","author":"F Cheah","year":"1996","unstructured":"Cheah, F., Corneil, D.G.: On the structure of trapezoid graphs. Discret. Appl. Math. 66, 109\u2013133 (1996)","journal-title":"Discret. Appl. Math."},{"key":"28_CR8","doi-asserted-by":"crossref","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. 60, 225\u2013230 (1996)","journal-title":"Inf. Process. Lett."},{"key":"28_CR9","unstructured":"Dagan, I., Golumbic, M.C., Pinter, R.Y.: Trapezoid graphs and their coloring. Discret. Appl. Math. 21, 35\u201346 (1988)"},{"key":"28_CR10","doi-asserted-by":"crossref","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. Discret. Appl. Math. 10, 139\u2013153 (1985)","journal-title":"Discret. Appl. Math."},{"key":"28_CR11","first-page":"289","volume":"287","author":"M Fontet","year":"1978","unstructured":"Fontet, M.: Graphes 4-essential. C. R. Acad. Sci. Paris 287, 289\u2013290 (1978)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(96)00265-4","volume":"181","author":"G Galbiati","year":"1997","unstructured":"Galbiati, G., Mattioli, F., Morzenti, A.: On the approximability of some maximum spanning tree problems. Theor. Comput. Sci. 181, 107\u2013118 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02832306","volume":"24","author":"PK Ghosh","year":"2007","unstructured":"Ghosh, P.K., Pal, M.: An effcient algorithm to solve connectivity problem on trapezoid graphs. J. Appl. Math. Comput. 24, 141\u2013154 (2007)","journal-title":"J. Appl. Math. Comput."},{"key":"28_CR14","unstructured":"Gy\u00f6ri, E.: On division of graph to connected subgraphs. In: Combinatoris (Proc. Fifth Hungarian Colloq., Koszthely, 1976), vol. I, Volume 18 of Colloq. Math. Soc. J\u00e1nos Bolyai, North-Holland, Amsterdam, 485\u2013494 (1978)"},{"key":"28_CR15","doi-asserted-by":"crossref","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. Hung. 30, 241\u2013251 (1977)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"28_CR16","doi-asserted-by":"crossref","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. Discret. Appl. Math. 42, 227\u2013256 (1993)","journal-title":"Discret. Appl. Math."},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF02939489","volume":"9","author":"J Ma","year":"1994","unstructured":"Ma, J., Ma, S.H.: An $$O(k^2n^2)$$ algorithm to find a $$k$$ -partition in a $$k$$ -connected graph. J. Comput. Sci. Technol. 9, 86\u201391 (1994)","journal-title":"J. Comput. Sci. Technol."},{"key":"28_CR18","doi-asserted-by":"crossref","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. Stat. Data Anal. 24, 217\u2013234 (1997)","journal-title":"Comput. Stat. Data Anal."},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190060310","volume":"6","author":"N Martinov","year":"1982","unstructured":"Martinov, N.: Uncontractible 4-connected graphs. J. Graph Theory 6, 343\u2013344 (1982)","journal-title":"J. Graph Theory"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0020-0190(97)00083-5","volume":"62","author":"S Nakano","year":"1997","unstructured":"Nakano, S., Rahman, M., Nishizeki, T.: A linear-time algorithm for four-partitioning four-connected planar graphs. Inf. Process. Lett. 62, 315\u2013322 (1997)","journal-title":"Inf. Process. Lett."},{"key":"28_CR21","doi-asserted-by":"crossref","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 28, 5\u201315 (1981)","journal-title":"J. ACM"},{"key":"28_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H Suzuki","year":"1990","unstructured":"Suzuki, H., Takahashi, N., Nishizeki, T.: A linear algorithm for $$2$$ -partition of bi-connected graphs. Inf. Process. Lett. 33, 227\u2013232 (1990)","journal-title":"Inf. Process. Lett."},{"key":"28_CR23","unstructured":"Suzuki, H., Takahashi, N., Nishizeki, T., Miyano, H., Ueno, S.: An algorithm for tri-partitioning 3-connected graphs. J. Inf. Process. Soc. Jpn. (1990)"},{"key":"28_CR24","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190050403","volume":"5","author":"C Thomassen","year":"1981","unstructured":"Thomassen, C.: Non-separating cycles in $$k$$ -connected graphs. J. Graph Theory 5, 351\u2013354 (1981)","journal-title":"J. Graph Theory"},{"key":"28_CR25","doi-asserted-by":"crossref","first-page":"1250005","DOI":"10.1142\/S179383091250005X","volume":"04","author":"BY Wu","year":"2012","unstructured":"Wu, B.Y.: Fully polynomial time approximation schemes for the max-min connected partition problem on interval graphs. Discret. Math. Algorithm. Appl. 04, 1250005 (2012)","journal-title":"Discret. Math. Algorithm. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0028-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0028-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0028-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:01Z","timestamp":1559278741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0028-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,3]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0028-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,3]]}}}