Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
430843 | Journal of Discrete Algorithms | 2015 | 9 Pages |
Abstract
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-uniform k-partite hypergraphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marek Karpinski, Richard Schmied, Claus Viehmann,