Set covering with ordered replacement: Additive and multiplicative gaps

Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement of an element by a smaller element is also in the set system. Many variants of Bin Packing that have appeared in the literature are such set covering problems with ordered replacement. We provide a rigorous account on the additive and multiplicative integrality gap and approximability of set covering with replacement. In particular we provide a polylogarithmic upper bound on the additive integrality gap that also yields a polynomial time additive approximation algorithm if the linear programming relaxation can be efficiently solved. We furthermore present an extensive list of covering problems that fall into our framework and consequently have polylogarithmic additive gaps as well.

本文言語English
ホスト出版物のタイトルInteger Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, Proceedings
ページ170-182
ページ数13
DOI
出版ステータスPublished - 2011
外部発表はい
イベント15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011 - New York, NY, United States
継続期間: 2011 6 152011 6 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6655 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011
国/地域United States
CityNew York, NY
Period11/6/1511/6/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Set covering with ordered replacement: Additive and multiplicative gaps」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル