We develop a novel framework, the implicit hitting set approach, for solving a class of combinatorial optimization problems. The explicit hitting set problem is as follows: given a set U and a family ...
当前正在显示可能无法访问的结果。
隐藏无法访问的结果当前正在显示可能无法访问的结果。
隐藏无法访问的结果