### Abstract

The 2-catalog segmentation problem is investigated. The problem is stated as: given a set I of n items and a family of p subsets of I, find two subsets (C_{1}, C_{2}) of I bounded by the catalog size r and the sum (2) is maximized. In general, only a trivial 0.5 approximation algorithm is known. An improvement upon this factor is made under the assumption that |I| is bounded by 2r.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |

Editors | Anon |

Publisher | SIAM |

State | Published - 1999 |

Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |

### Other

Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

City | Baltimore, MD, USA |

Period | 1/17/99 → 1/19/99 |

### Fingerprint

### ASJC Scopus subject areas

- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics

### Cite this

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*SIAM.

**2-Catalog segmentation problem.** / Dodis, Yevgeniy; Guruswami, Venkatesan; Khanna, Sanjeev.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.*SIAM, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.

}

TY - GEN

T1 - 2-Catalog segmentation problem

AU - Dodis, Yevgeniy

AU - Guruswami, Venkatesan

AU - Khanna, Sanjeev

PY - 1999

Y1 - 1999

N2 - The 2-catalog segmentation problem is investigated. The problem is stated as: given a set I of n items and a family of p subsets of I, find two subsets (C1, C2) of I bounded by the catalog size r and the sum (2) is maximized. In general, only a trivial 0.5 approximation algorithm is known. An improvement upon this factor is made under the assumption that |I| is bounded by 2r.

AB - The 2-catalog segmentation problem is investigated. The problem is stated as: given a set I of n items and a family of p subsets of I, find two subsets (C1, C2) of I bounded by the catalog size r and the sum (2) is maximized. In general, only a trivial 0.5 approximation algorithm is known. An improvement upon this factor is made under the assumption that |I| is bounded by 2r.

UR - http://www.scopus.com/inward/record.url?scp=0032785514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032785514&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032785514

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -