Faster Optimal Algorithms for Segment Minimization with Small Maximal Value
The segment minimization problem consists of finding the smallest set of integer matrices (segments) that sum to a given intensity matrix, such that each summand has only one non-zero value (the segment-value), and the non-zeroes in each row are consecutive. This has direct applications in intensity-modulated radiation therapy, an effective form of cancer treatment.
We study here the special case when the largest value H in the intensity matrix is small. We show that for an intensity matrix with one row, this problem is fixed-parameter tractable (FPT) in H; our algorithm obtains a significant asymptotic speedup over the previous best FPT algorithm. We also show how to solve the full-matrix problem faster than all previously known algorithms. Finally, we address a closely related problem that deals with minimizing the number of segments subject to a minimum beam-on-time, defined as the sum of the segment-values. Here, we obtain an almost-quadratic speedup.
KeywordsIntensity Matrix Segmentation Problem Multileaf Collimator Information Processing Letter Discrete Apply Mathematic
Unable to display preview. Download preview PDF.
- 2.Baatar, D., Hamacher, H.W.: New LP model for multileaf collimators in radiation therapy. In: Contribution to the Conference ORP3. Universität Kaiserslautern (2003)Google Scholar
- 5.Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., Young, M.: Faster optimal algorithms for segments minimization with small maximal value. Technical Report CS-2011-08. University of Waterloo (2011)Google Scholar
- 7.Brand, S.: The sum-of-increments constraint in the consecutive-ones matrix decomposition problem. In: Proceedings of the 24th Symposium on Applied Computing (SAC), pp. 1417–1418 (2009)Google Scholar