| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428337 | Information Processing Letters | 2007 | 5 Pages |
Abstract
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
