A circular matrix-merging algorithm with application in volumetric intensity-modulated arc therapy

DOI10.1016/J.TCS.2015.04.028MaRDI QIDQ897939zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Lin Yang, D. Craft

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.04.028

zbMATH Keywords

dynamic programming\(k\)-link shortest pathmatrix mergingvolumetric intensity modulated arc therapy

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• A circular matrix-merging algorithm with application in VMAT radiation therapy
• A network approach for segmentation in intensity modulated arc therapy
• Approximation algorithms for minimizing segments in radiation therapy
• EFFICIENT ALGORITHM FOR OPTIMAL MATRIX ORTHOGONAL DECOMPOSITION PROBLEM IN INTENSITY-MODULATED RADIATION THERAPY
• Solving circular integral block decomposition in polynomial time

Cites work

• Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
• Finding a minimum-weight k-link path in graphs with the concave Monge property and applications

Cited in

(2)

• Solving circular integral block decomposition in polynomial time
• A circular matrix-merging algorithm with application in VMAT radiation therapy

This page was built for publication: A circular matrix-merging algorithm with application in volumetric intensity-modulated arc therapy

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