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

DOI10.1016/J.TCS.2015.04.028zbMath1342.90217OpenAlexW1976626953MaRDI QIDQ897939

Danny Z. Chen, Lin Yang, David L. 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)

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

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