{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:25Z","timestamp":1725889885826},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_5","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"27-38","source":"Crossref","is-referenced-by-count":12,"title":["Minimizing Setup and Beam-On Times in Radiation Therapy"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Coppersmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/net.20047","volume":"44","author":"R.K. Ahuja","year":"2005","unstructured":"Ahuja, R.K., Hamacher, H.W.: A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks\u00a044, 36\u201341 (2005)","journal-title":"Networks"},{"key":"5_CR2","unstructured":"Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. 31\u201340 (1999)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM\u00a048, 1069\u20131090 (2001)","journal-title":"Journal of the ACM"},{"key":"5_CR4","unstructured":"Bernstein, S.: Theory of Probability. Moscow (1927)"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1118\/1.597257","volume":"21","author":"A.L. Boyer","year":"1994","unstructured":"Boyer, A.L.: Use of MLC for intensity modulation. Medical Physics\u00a021, 1007 (1994)","journal-title":"Medical Physics"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/0360-3016(94)90200-3","volume":"28","author":"T.R. Bortfeld","year":"1994","unstructured":"Bortfeld, T.R., Kahler, D.L., Waldron, T.J., Boyer, A.L.: X-ray field compensation with multileaf collimators. Int. Journal of radiation Oncology, Biology, Physics\u00a028, 723\u2013730 (1994)","journal-title":"Int. Journal of radiation Oncology, Biology, Physics"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/net.20007","volume":"43","author":"N.H. Boland","year":"2004","unstructured":"Boland, N.H., Hamacher, H.W., Lenzen, F.: Minimizing beam-on time in cancer radiation therapy using multileaf collimators. Networks\u00a043, 226\u2013240 (2004)","journal-title":"Networks"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Hu, X.S., Luan, S., Wang, C., Wu, X.: Mountain reduction, block matching, and applications in intensity modulation radiation therapy. In: Proc. 21st ACM Symp. on Computational Geometry, pp. 35\u201344 (2005)","DOI":"10.1145\/1064092.1064101"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1118\/1.1406518","volume":"28","author":"J. Dai","year":"2001","unstructured":"Dai, J., Zhu, Y.: Minimizing the number of segments in a delivery sequence for intensity modulated radiation therapy with multileaf collimator. Medical Physics\u00a028, 2113\u20132120 (2001)","journal-title":"Medical Physics"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th ACM Symp. on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics\u00a02, 68\u201372 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1088\/0031-9155\/49\/1\/003","volume":"49","author":"S. Kamath","year":"2004","unstructured":"Kamath, S., Sahni, S., Palta, J., Ranka, S.: Algorithms for optimal sequencing of dynamic multileaf collimators. Physics in Medicine and Biology\u00a049, 33\u201354 (2004)","journal-title":"Physics in Medicine and Biology"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1088\/0031-9155\/49\/3\/N01","volume":"49","author":"S. Kamath","year":"2004","unstructured":"Kamath, S., Sahni, S., Palta, J., Ranka, S., Li, J.: Optimal leaf sequencing with elimination of tongue-and-groove underdosage. Physics in Medicine and Biology\u00a049, N7\u2013N19 (2004)","journal-title":"Physics in Medicine and Biology"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Computational Complexity\u00a04, 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A Unifying Look at Data Structures. Comm. ACM\u00a023, 229\u2013239 (1980)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:39Z","timestamp":1605644319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11830924_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}