Login / Signup
Solving Set Cover and Dominating Set via Maximum Satisfiability.
Zhendong Lei
Shaowei Cai
Published in:
AAAI (2020)
Keyphrases
</>
set cover
dominating set
approximation algorithms
facility location problem
greedy algorithm
maximum satisfiability
network flow
np hard
connected dominating set
greedy heuristic
primal dual
sat problem
max sat
convex hull
worst case
cost function
special case