An approximation algorithm for submodular hitting set problem with linear penalties

2020 ◽  
Vol 40 (4) ◽  
pp. 1065-1074
Author(s):  
Shaojing Du ◽  
Suogang Gao ◽  
Bo Hou ◽  
Wen Liu
Keyword(s):  
Approximation Algorithm ◽  
Hitting Set ◽  
Hitting Set Problem ◽  
Linear Penalties

scholarly journals A randomised approximation algorithm for the hitting set problem

2014 ◽  
Vol 555 ◽  
pp. 23-34 ◽  
Author(s):  
Mourad El Ouali ◽  
Helena Fohlin ◽  
Anand Srivastav
Keyword(s):  
Approximation Algorithm ◽  
Hitting Set ◽  
Hitting Set Problem

scholarly journals AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY

2010 ◽  
Vol 02 (01) ◽  
pp. 21-31 ◽  
Author(s):  
MARY V. ASHLEY ◽  
TANYA Y. BERGER-WOLF ◽  
WANPRACHA CHAOVALITWONGSE ◽  
BHASKAR DASGUPTA ◽  
ASHFAQ KHOKHAR ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Wild Population ◽  
Combinatorial Optimization Problem ◽  
Set Cover ◽  
Not Given ◽  
Wild Populations ◽  
Feedback Arc Set ◽  
Hitting Set ◽  
Cover Problem ◽  
Hitting Set Problem

In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known minimum feedback arc set problem is such a problem. In this paper, we consider such a cover problem that arises in the study of wild populations in biology in which the sets are defined implicitly via the Mendelian constraints and prove approximability results for this problem.

Sign in / Sign up

Export Citation Format

Share Document