Sciweavers

36 search results - page 8 / 8
» Preservation Under Extensions on Well-Behaved Finite Structu...
Sort
View
211
Voted
ICALP
2010
Springer
16 years 6 days ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket