{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T13:34:14Z","timestamp":1671543254672},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T00:00:00Z","timestamp":1269475200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9308-8","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T16:40:49Z","timestamp":1269448849000},"page":"609-629","source":"Crossref","is-referenced-by-count":1,"title":["A closest vector problem arising in\u00a0radiation therapy planning"],"prefix":"10.1007","volume":"22","author":[{"given":"C\u00e9line","family":"Engelbeen","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"given":"Antje","family":"Kiesel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,25]]},"reference":[{"key":"9308_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20047","volume":"45","author":"RK Ahuja","year":"2005","unstructured":"Ahuja RK, Hamacher HW (2005) A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45:36\u201341","journal-title":"Networks"},{"key":"9308_CR2","series-title":"Wiley-Interscience series in discrete mathematics and optimization","volume-title":"The probabilistic method","author":"N Alon","year":"1992","unstructured":"Alon N, Spencer J (1992) The probabilistic method. Wiley-Interscience series in discrete mathematics and optimization. Wiley-Interscience, New York"},{"issue":"3","key":"9308_CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998) Proof verification and the hardness of approximation problems. J ACM 45(3):501\u2013555","journal-title":"J ACM"},{"key":"9308_CR4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.dam.2005.04.008","volume":"152","author":"D Baatar","year":"2005","unstructured":"Baatar D, Hamacher HW, Ehrgott M, Woeginger GJ (2005) Decomposition of integer matrices and multileaf collimator sequencing. Discrete Appl Math 152:6\u201334","journal-title":"Discrete Appl Math"},{"key":"9308_CR5","doi-asserted-by":"crossref","unstructured":"Bansal N (2010) Constructive algorithms for discrepancy minimization. arXiv:1002.2259v1","DOI":"10.1109\/FOCS.2010.7"},{"issue":"4","key":"9308_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/net.20007","volume":"43","author":"N Boland","year":"2004","unstructured":"Boland N, Hamacher HW, Lenzen F (2004) Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43(4):226\u2013240","journal-title":"Networks"},{"key":"9308_CR7","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/0360-3016(94)90200-3","volume":"28","author":"TR Bortfeld","year":"1994","unstructured":"Bortfeld TR, Kahler DL, Waldron TJ, Boyer AL (1994) X-ray field compensation with multileaf collimators. Int J Radiat Oncol Biol Phys 28:723\u2013730","journal-title":"Int J Radiat Oncol Biol Phys"},{"issue":"1","key":"9308_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00453-007-9076-8","volume":"51","author":"J Cardinal","year":"2008","unstructured":"Cardinal J, Fiorini S, Joret G (2008) Tight results on minimum entropy set cover. Algorithmica 51(1):49\u201360","journal-title":"Algorithmica"},{"key":"9308_CR9","first-page":"162","volume-title":"Proceedings of ALENEX 2009","author":"B Doerr","year":"2009","unstructured":"Doerr B, Wahlstr\u00f6m M (2009) Randomized rounding in the presence of a cardinality constraint. In: Proceedings of ALENEX 2009. SIAM, Philadelphia, pp 162\u2013174"},{"issue":"17","key":"9308_CR10","doi-asserted-by":"crossref","first-page":"5253","DOI":"10.1088\/0031-9155\/54\/17\/012","volume":"54","author":"K Engel","year":"2009","unstructured":"Engel K, Gauer T (2009) A dose optimization method for electron radiotherapy using randomized aperture beams. Phys Med Biol 54(17):5253\u20135270","journal-title":"Phys Med Biol"},{"key":"9308_CR11","author":"C Engelbeen","year":"2009","unstructured":"Engelbeen C, Fiorini S (2009) Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy. Networks. doi: 10.1002\/net.20324","journal-title":"Networks"},{"issue":"4","key":"9308_CR12","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln\u2009n for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"issue":"4","key":"9308_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U Feige","year":"2004","unstructured":"Feige U, Lov\u00e1sz L, Tetali P (2004) Approximating min sum set cover. Algorithmica 40(4):219\u2013234","journal-title":"Algorithmica"},{"key":"9308_CR14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.dam.2004.10.008","volume":"152","author":"T Kalinowski","year":"2005","unstructured":"Kalinowski T (2005) A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. Discrete Appl Math 152:52\u201388","journal-title":"Discrete Appl Math"},{"key":"9308_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1007\/11889342_65","volume-title":"Information transfer and combinatorics","author":"T Kalinowski","year":"2006","unstructured":"Kalinowski T (2006) Realization of intensity modulated radiation fields using multileaf collimators. In: Ahlswede R et al. (eds) Information transfer and combinatorics. LNCS, vol 4123. Springer, Berlin, pp 1010\u20131055"},{"key":"9308_CR16","first-page":"253","volume-title":"Optimization in medicine and biology","author":"T Kalinowski","year":"2008","unstructured":"Kalinowski T (2008a) Multileaf collimator shape matrix decomposition. In: Lim GJ, Lee EK (eds) Optimization in medicine and biology. Auerbach Publishers, Boca Raton, pp 253\u2013286"},{"key":"9308_CR17","unstructured":"Kalinowski T (2008b) Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition. Algorithmic Oper Res 3(2)"},{"issue":"3","key":"9308_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1088\/0031-9155\/48\/3\/303","volume":"48","author":"S Kamath","year":"2003","unstructured":"Kamath S, Sahni S, Li J, Palta J, Ranka S (2003) Leaf sequencing algorithms for segmented multileaf collimation. Phys Med Biol 48(3):307\u2013324","journal-title":"Phys Med Biol"},{"key":"9308_CR19","doi-asserted-by":"crossref","first-page":"N7","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 (2004a) Optimal leaf sequencing with elimination of tongue-and-groove underdosage. Phys Med Biol 49:N7\u2013N19","journal-title":"Phys Med Biol"},{"key":"9308_CR20","doi-asserted-by":"crossref","first-page":"3137","DOI":"10.1088\/0031-9155\/49\/14\/008","volume":"49","author":"S Kamath","year":"2004","unstructured":"Kamath S, Sahni S, Ranka S, Li J, Palta J (2004b) A comparison of step-and-shoot leaf sequencing algorithms that eliminate tongue-and-groove effects. Phys Med Biol 49:3137\u20133143","journal-title":"Phys Med Biol"},{"key":"9308_CR21","unstructured":"Kiesel A, Gauer T (2009) Approximated segmentation considering technical and dosimetric constraints in intensity-modulated radiation therapy, submitted and part of the doctoral thesis \u201cImplementierung der intensit\u00e4tsmodulierten Strahlentherapie mit Elektronen\u201d of Tobias Gauer, Department of Radiotherapy and Radio-Oncology, University Medical Center Hamburg-Eppendorf"},{"key":"9308_CR22","volume-title":"Post-quantum cryptography","author":"D Micciancio","year":"2008","unstructured":"Micciancio D, Regev O (2008) Lattice-based cryptography. In: Bernstein DJ, Buchmann J (eds) Post-quantum cryptography. Springer, Berlin"},{"key":"9308_CR23","first-page":"447","volume-title":"Approximation algorithms for NP-hard problems","author":"R Motwani","year":"1997","unstructured":"Motwani R, Naor J, Raghavan P (1997) Randomized approximation algorithms in combinatorial optimization. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS, Boston, pp\u00a0447\u2013481"},{"key":"9308_CR24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1088\/0031-9155\/49\/3\/004","volume":"49","author":"W Que","year":"2004","unstructured":"Que W, Kung J, Dai J (2004) \u2018Tongue-and-groove\u2019 effect in intensity modulated radiotherapy with static multileaf collimator fields. Phys Med Biol 49:399\u2013405","journal-title":"Phys Med Biol"},{"key":"9308_CR25","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P Raghavan","year":"1988","unstructured":"Raghavan P (1988) Probabilistic construction of deterministic algorithms: approximating packing integer programs. J Comput Syst Sci 37:130\u2013143","journal-title":"J Comput Syst Sci"},{"key":"9308_CR26","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/SFCS.2001.959935","volume-title":"42nd IEEE symposium on foundations of computer science","author":"A Srinivasan","year":"2001","unstructured":"Srinivasan A (2001) Distributions on level-sets with applications to approximation algorithms. In: 42nd IEEE symposium on foundations of computer science, Las Vegas, NV, 2001. IEEE Comput. Soc., Los Alamitos, pp 588\u2013597"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9308-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9308-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9308-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:16Z","timestamp":1559261896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9308-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,25]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9308"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9308-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,25]]}}}