Nonnegative integral subset representations of integer sets

Authors:
Michael J. Collins;David Kempe;Jared Saia;Maxwell Young
Affiliations:
Sandia National Laboratories, Albuquerque, NM, USA;Department of Computer Science, University of Southern California, CA, USA;Department of Computer Science, University of New Mexico, NM, USA;Department of Computer Science, University of New Mexico, NM, USA
Venue:
Information Processing Letters
Year:
2007

Citing 1
Cited 8

The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Approximation algorithms for minimizing segments in radiation therapy

Information Processing Letters
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators

Computers and Operations Research
On Finding Small 2-Generating Sets

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Faster optimal algorithms for segment minimization with small maximal value

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A shortest path-based approach to the multileaf collimator sequencing problem

Discrete Applied Mathematics
Hybrid methods for the multileaf collimator sequencing problem

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Faster optimal algorithms for segment minimization with small maximal value

Discrete Applied Mathematics
Estimating viral haplotypes in a population using k-mer counting

PRIB'13 Proceedings of the 8th IAPR international conference on Pattern Recognition in Bioinformatics

Quantified Score

Hi-index	0.89

Visualization

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.