Faster optimal algorithms for segment minimization with small maximal value

DOI10.1016/J.DAM.2012.09.011MaRDI QIDQ1932452zbMATH OpenOpenAlexFDO

Authors Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young, Therese Biedl

Publication date 18 January 2013

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.09.011

zbMATH Keywords

algorithmnonnegative matrixintensity-modulated radiation therapymultileaf collimatorsegmentation problem

Mathematics Subject Classification ID

Medical applications (general) (92C50) Numerical linear algebra (65F99) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• Faster optimal algorithms for segment minimization with small maximal value
• Approximation algorithms for minimizing segments in radiation therapy
• A note on improving the performance of approximation algorithms for radiation therapy
• A network approach for segmentation in intensity modulated arc therapy
• Minimizing Setup and Beam-On Times in Radiation Therapy

Cited in

(5)

• An integer linear programming formulation for the minimum cardinality segmentation problem
• Faster optimal algorithms for segment minimization with small maximal value
• Fast algorithms for minimum matrix norm with application in computer graphics
• A note on improving the performance of approximation algorithms for radiation therapy
• On explaining integer vectors by few homogeneous segments

This page was built for publication: Faster optimal algorithms for segment minimization with small maximal value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932452)