{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:39Z","timestamp":1725515979858},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_6","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"38-49","source":"Crossref","is-referenced-by-count":0,"title":["New Upper Bounds on Continuous Tree Edge-Partition Problem"],"prefix":"10.1007","author":[{"given":"Robert","family":"Benkoczi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaosheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Benkoczi, R.: Cardinality constrainted facility location problems in trees, Ph.D. Thesis, School of computing secience, SFU, Canada (2004)"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. Sys. Sci."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM\u00a034, 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.dam.2003.04.002","volume":"140","author":"N. Halman","year":"2004","unstructured":"Halman, N., Tamir, A.: Continuous bottleneck tree partitioning problems. Disc. App. Math.\u00a0140, 185\u2013206 (2004)","journal-title":"Disc. App. Math."},{"key":"6_CR5","unstructured":"Lin, J.-J., Chan, C.-Y., Wang, B.-F.: Improved algorithms for the continuous tree edge-partition problems. Disc. App. Math. (submitted, 2007)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput.\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput.\u00a04, 348\u2013355 (1975)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:17:10Z","timestamp":1620001030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}