{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:17Z","timestamp":1761620777369},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0166-218x(93)90137-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"1-28","source":"Crossref","is-referenced-by-count":16,"title":["A shifting algorithm for constrained min-max partition on trees"],"prefix":"10.1016","volume":"45","author":[{"given":"Eliezer","family":"Agasi","sequence":"first","affiliation":[]},{"given":"Ronald I.","family":"Becker","sequence":"additional","affiliation":[]},{"given":"Yehoshua","family":"Perl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90137-D_BIB1","first-page":"253","author":"Agasi","year":"1982","journal-title":"A shifting algorithm for constrained min-max partition of trees"},{"key":"10.1016\/0166-218X(93)90137-D_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0196-6774(83)90039-1","article-title":"Shifting algorithms for tree partitioning with general weighting functions","volume":"4","author":"Becker","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90137-D_BIB3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322290.322294","article-title":"A shifting algorithm for min-max tree-partitioning","volume":"29","author":"Becker","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90137-D_BIB4","series-title":"Computers and Intractability","author":"Gary","year":"1979"},{"key":"10.1016\/0166-218X(93)90137-D_BIB5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(93)90137-D_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(93)90137-D_BIB7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0206012","article-title":"A linear tree-partitioning algorithm","volume":"6","author":"Kundu","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90137-D_BIB8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max-min tree-partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90137-D_BIB9","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0604050","article-title":"Efficient optimization of monotonic functions on trees","volume":"4","author":"Perl","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(93)90137-D_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/net.3230130305","article-title":"Circuit partitioning with size and connection constraints","volume":"13","author":"Perl","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90137-D_BIB11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0166-218X(85)90041-1","article-title":"Efficient implementation of a shifting algorithm","volume":"12","author":"Perl","year":"1985","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390137D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390137D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:47Z","timestamp":1555136747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390137D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0166218X9390137D"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90137-d","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}