Minimizing Setup and Beam-On Times in Radiation Therapy

DOI10.1007/11830924_5zbMath1155.92325OpenAlexW1542127549MaRDI QIDQ3595380

Don Coppersmith, Baruch Schieber, Nikhil Bansal

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_5

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Medical applications (general) (92C50) Approximation algorithms (68W25)

Related Items (9)

Nonnegative integral subset representations of integer sets ⋮ Approximation algorithms for minimizing segments in radiation therapy ⋮ Balanced tree partition problems with virtual nodes ⋮ A note on improving the performance of approximation algorithms for radiation therapy ⋮ Representing a functional curve by curves with fewer peaks ⋮ CP and IP approaches to cancer radiotherapy delivery optimization ⋮ The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ Balanced partitions of trees and applications

This page was built for publication: Minimizing Setup and Beam-On Times in Radiation Therapy