Approximation algorithms for minimizing segments in radiation therapy

DOI10.1016/J.IPL.2006.10.003zbMATH Open1184.68644OpenAlexW2020946584MaRDI QIDQ845938FDOQ845938

Authors: Shuang Luan, Jared Saia, Maxwell Young 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.003

Recommendations

• A note on improving the performance of approximation algorithms for radiation therapy
• Computing and Combinatorics
• An almost linear time algorithm for field splitting in radiation therapy
• A class of optimization problems in radiotherapy dosimetry planning
• Geometric algorithms for static leaf sequencing problems in radiation therapy
• GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
• A convex optimization approach to radiation treatment planning with dose constraints
• Linear programing formulations and algorithms for radiotherapy treatment planning
• A closest vector problem arising in radiation therapy planning
• Partitioning multiple objective optimal solutions with applications in radiotherapy design

zbMATH Keywords

segmentationintensity modulated radiation therapyapproximation algorithmsmultileaf collimator

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Approximation algorithms (68W25)

Cites Work

• A new algorithm for optimal multileaf collimator field segmentation
• Minimizing beam-on time in cancer radiation treatment using multileaf collimators
• Nonnegative integral subset representations of integer sets
• Minimizing Setup and Beam-On Times in Radiation Therapy
• Algorithms and Computation

Cited In (17)

• Mathematical optimization in intensity modulated radiation therapy
• GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
• Shape rectangularization problems in intensity-modulated radiation therapy
• A closest vector problem arising in radiation therapy planning
• Faster optimal algorithms for segment minimization with small maximal value
• Faster optimal algorithms for segment minimization with small maximal value
• Discrete approximations to real-valued leaf sequencing problems in radiation therapy
• A note on improving the performance of approximation algorithms for radiation therapy
• A circular matrix-merging algorithm with application in VMAT radiation therapy
• Computing and Combinatorics
• A circular matrix-merging algorithm with application in volumetric intensity-modulated arc therapy
• Mathematical optimization in intensity modulated radiation therapy
• Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
• Minimizing Setup and Beam-On Times in Radiation Therapy
• On explaining integer vectors by few homogeneous segments
• A network approach for segmentation in intensity modulated arc therapy
• Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications

This page was built for publication: Approximation algorithms for minimizing segments in radiation therapy

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