2-Catalog segmentation problem

Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 (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.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
StatePublished - 1999
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

Fingerprint

Approximation algorithms
Segmentation
Subset
Approximation Algorithms
Trivial
Family

ASJC Scopus subject areas

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

Cite this

Dodis, Y., Guruswami, V., & Khanna, S. (1999). 2-Catalog segmentation problem. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms SIAM.

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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y, Guruswami, V & Khanna, S 1999, 2-Catalog segmentation problem. in Anon (ed.), 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.
Dodis Y, Guruswami V, Khanna S. 2-Catalog segmentation problem. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999
Dodis, Yevgeniy ; Guruswami, Venkatesan ; Khanna, Sanjeev. / 2-Catalog segmentation problem. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999.
@inproceedings{d792ea316d6240fdbd71b9b6c317c7a6,
title = "2-Catalog segmentation problem",
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 (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.",
author = "Yevgeniy Dodis and Venkatesan Guruswami and Sanjeev Khanna",
year = "1999",
language = "English (US)",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

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

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

A2 - Anon, null

PB - SIAM

ER -