Presentation 2001/11/9
On Approximation Alogorithms for Minimum Multiset Covering>
Yutaka YAGIURA, Shinichi SHIMOZOO, Tatsuya AKUTSU,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Given a multiset A^^ over finite set U and colletion C(*⫅)2^U, Minimum Multiset Covering is the probiem to find a smallest subset C(*⫅)C that covers A^^. This problem is a natural extension of Minimum set Covering where U is extented to a multiset A^^. We Present a polynomial-time approximation algorithm for Minimum Multiset Covering, and prove that the algorithmguarantees an approximation ratio 1+In n with the total size n of A. Also we show that the algorithm can be extented with the similar ratio to one for the problem where cover can have multisets.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) polynomial-time approximation algorithm / min set covering / selection of informative genes
Paper # COMP 2001-54
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/11/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Approximation Alogorithms for Minimum Multiset Covering>
Sub Title (in English)
Keyword(1) polynomial-time approximation algorithm
Keyword(2) min set covering
Keyword(3) selection of informative genes
1st Author's Name Yutaka YAGIURA
1st Author's Affiliation Graduate School of Computer Science and System Engineering, Information Science, Kyushu Institute of Technology()
2nd Author's Name Shinichi SHIMOZOO
2nd Author's Affiliation Department of Artifical Intellligence, Kyushu Institute of Technology
3rd Author's Name Tatsuya AKUTSU
3rd Author's Affiliation Kyoto University Bioinformatics Center Uji
Date 2001/11/9
Paper # COMP 2001-54
Volume (vol) vol.101
Number (no) 431
Page pp.pp.-
#Pages 8
Date of Issue