Faster optimal algorithms for segment minimization with small maximal value

DOI10.1007/978-3-642-22300-6_8MaRDI QIDQ5199233zbMATH OpenOpenAlexFDO

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

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_8

Mathematics Subject Classification ID

Matrices of integers (15B36) Positive matrices and their generalizations; cones of matrices (15B48) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Medical applications (general) (92C50)

Recommendations

• Faster optimal algorithms for segment minimization with small maximal value
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• A note on improving the performance of approximation algorithms for radiation therapy
• Approximation algorithms for minimizing segments in radiation therapy
• A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy

Cited in

(3)

• Faster optimal algorithms for segment minimization with small maximal value
• 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 Q5199233)