A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

SIAM Journal on Computing ◽

10.1137/s0097539704444750 ◽

2005 ◽

Vol 35 (1) ◽

pp. 189-200 ◽

Author(s):

Refael Hassin ◽

Asaf Levin

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Greedy Approximation ◽

Set Cover Problem ◽

Cover Problem ◽

Download Full-text

An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint

10.1007/978-3-030-85906-0_36 ◽

2021 ◽

pp. 317-325

Author(s):

Yin Wang ◽

Yinfeng Xu

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

An Approximation Algorithm for the Minimum Latency Set Cover Problem

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_64 ◽

2005 ◽

pp. 726-733 ◽

Author(s):

Refael Hassin ◽

Asaf Levin

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Minimum Latency ◽

Download Full-text

Approximation Algorithm for Stochastic Set Cover Problem

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-030-57602-8_4 ◽

2020 ◽

pp. 37-48

Author(s):

Haiyun Sheng ◽

Donglei Du ◽

Yuefang Sun ◽

Jian Sun ◽

Xiaoyan Zhang

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

Packing-Based Approximation Algorithm for the k-Set Cover Problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-25591-5_50 ◽

2011 ◽

pp. 484-493 ◽

Author(s):

Martin Fürer ◽

Huiwen Yu

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

A New Approximation Algorithm for k-Set Cover Problem

Arabian Journal for Science and Engineering ◽

10.1007/s13369-015-1895-3 ◽

2015 ◽

Vol 41 (3) ◽

pp. 935-940

Author(s):

Hanaa A. E. Essa ◽

Yasser M. Abd El-Latif ◽

Salwa M. Ali ◽

Soheir M. Khamis

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

An Approximation Algorithm for P-prize-collecting Set Cover Problem

Journal of the Operations Research Society of China ◽

10.1007/s40305-021-00364-7 ◽

2021 ◽

Author(s):

Jin-Shuang Guo ◽

Wen Liu ◽

Bo Hou

Keyword(s):

Approximation Algorithm ◽

Set Cover ◽

Set Cover Problem ◽

Prize Collecting ◽

Download Full-text

Improved analysis of the online set cover problem with advice

Theoretical Computer Science ◽

10.1016/j.tcs.2017.05.029 ◽

2017 ◽

Vol 689 ◽

pp. 96-107 ◽

Author(s):

Stefan Dobrev ◽

Jeff Edmonds ◽

Dennis Komm ◽

Rastislav Královič ◽

Richard Královič ◽

...

Keyword(s):

Set Cover ◽

Set Cover Problem ◽

Download Full-text

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_23 ◽

2007 ◽

pp. 290-301 ◽

Author(s):

Asaf Levin

Keyword(s):

Local Search ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

Connected Set Cover Problem and Its Applications

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/11775096_23 ◽

2006 ◽

pp. 243-254 ◽

Author(s):

Tian-Ping Shuai ◽

Xiao-Dong Hu

Keyword(s):

Set Cover ◽

Set Cover Problem ◽

Connected Set ◽

Cover Problem ◽

Connected Set Cover

Download Full-text

Homogeneous and Heterogeneous Island Models for the Set Cover Problem

Lecture Notes in Computer Science - Parallel Problem Solving from Nature - PPSN XII ◽

10.1007/978-3-642-32937-1_2 ◽

2012 ◽

pp. 11-20 ◽

Author(s):

Andrea Mambrini ◽

Dirk Sudholt ◽

Xin Yao

Keyword(s):

Set Cover ◽

Island Models ◽

Set Cover Problem ◽

Download Full-text