{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:07Z","timestamp":1725663187532},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:01:37Z","timestamp":1330171297000},"page":"64-75","source":"Crossref","is-referenced-by-count":1,"title":["A shifting algorithm for min-max tree partitioning"],"prefix":"10.1007","author":[{"given":"Ronald I.","family":"Becker","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Perl","sequence":"additional","affiliation":[]},{"given":"Stephen R.","family":"Schach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"7_CR1","unstructured":"BECKER, R.I., PERL, Y. and SCHACH, S.R. A shifting algorithm for min-max tree partitioning, Technical Report, Computer Science Department, University of Cape Town, Rondebosch, South Africa."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"COOK, S.A. The complexity of theorem proving procedures. Proc. Third ACM Symp. on Theory of Computing, 1971, pp. 151\u2013159.","DOI":"10.1145\/800157.805047"},{"key":"7_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"GAREY, M.R. and JOHNSON, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979."},{"key":"7_CR4","unstructured":"HADLOCK, F. Minimum spanning forests of bounded trees. Proc. Fifth S.E. Conf. on Combinatorics, Graph Theory, and Computing, 1974, pp.449\u2013460."},{"issue":"3","key":"7_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0204029","volume":"4","author":"W. H. Hosken","year":"1975","unstructured":"HOSKEN, W.H. Optimum partitions of tree addressing structures, SIAM J. Computing, 4, 3(1975), pp. 341\u2013347.","journal-title":"SIAM J. Computing"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer, Computations","author":"R. M. Karp","year":"1972","unstructured":"KARP, R.M. Reducibility among combinatorial problems. In Complexity of Computer, Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85\u2013104."},{"issue":"1","key":"7_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0206012","volume":"6","author":"S. Kundu","year":"1977","unstructured":"KUNDU, S. and MISRA, J. A linear tree partitioning algorithm. SIAM J. Computing, 6,1(1977), pp.151\u2013154.","journal-title":"SIAM J. Computing"},{"key":"7_CR8","unstructured":"PERL, Y. and SCHACH, S.R. Max-min tree partitioning. To appear in JACM."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:33:05Z","timestamp":1619541185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}