Blar i Faculty of Mathematics and Natural Sciences på emneord "subexponential time algorithms"
Viser treff 1-1 av 1
-
Subexponential Algorithms for Partial Cover Problems
(Peer reviewed; Journal article, 2009)Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ...