Shape rectangularization problems in intensity-modulated radiation therapy

DOI10.1007/s00453-009-9354-8zbMath1215.68245OpenAlexW2053482920MaRDI QIDQ534786

Baruch Schieber, Chao Wang, Don Coppersmith, Shuang Luan, Danny Z. Chen, Ewa Misiołek, Nikhil Bansal, Xiaobo Sharon Hu

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9354-8

zbMATH Keywords

dynamic programminginteger linear programmingintensity-modulated radiation therapyshape approximationshape rectangularization

Mathematics Subject Classification ID

Integer programming (90C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Medical applications (general) (92C50) Approximation algorithms (68W25)

Related Items (1)

On explaining integer vectors by few homogeneous segments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 2.5-factor approximation algorithm for the \(k\)-MST problem
• Geometric applications of a matrix-searching algorithm
• The hardness of approximation: Gap location
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• Decomposition of integer matrices and multileaf collimator sequencing
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY
• A unifying look at data structures
• Optimal quantization by matrix searching
• Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• Minimizing beam-on time in cancer radiation treatment using multileaf collimators
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Shape rectangularization problems in intensity-modulated radiation therapy