arXiv Open Access 2011

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs

Marek Karpinski Richard Schmied Claus Viehmann

Lihat Sumber

Abstrak

We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.

Topik & Kata Kunci

cs.DS

Penulis (3)

Marek Karpinski

Richard Schmied

Claus Viehmann

Format Sitasi

APA MLA BibTeX

Karpinski, M., Schmied, R., Viehmann, C. (2011). Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. https://arxiv.org/abs/1107.2000

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓