6 search results - page 2 / 2 » Inapproximability of Hypergraph Vertex Cover and Application... |
160
Voted
TAMC
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...