Skip to main content
Article thumbnail
Location of Repository

A Note on Improving the Performance of Approximation Algorithms for Radiation Therapy

By Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia and Maxwell Young

Abstract

The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes in each row are consecutive. This has direct applications to an effective form of cancer treatment. Using several insights, we extend previous results to obtain constant-factor improvements in the approximation guarantees. We show that these improvements yield better performance by providing an experimental evaluation of all known approximation algorithms using both synthetic and real-world clinical data. Our algorithms are superior for 76 % of instances and we argue for their utility alongside the heuristic approaches used in practice

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.187.436
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.unm.edu/%7Esaia/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.