Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
Data Structures and Algorithms
2011-07-12 v1
Abstract
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
Keywords
Cite
@article{arxiv.1107.2000,
title = {Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs},
author = {Marek Karpinski and Richard Schmied and Claus Viehmann},
journal= {arXiv preprint arXiv:1107.2000},
year = {2011}
}
Related papers
View all related →
Computational Complexity · Computer Science
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2012-10-10
Data Structures and Algorithms · Computer Science
Approximating Vertex Cover in Dense Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010-12-14
Data Structures and Algorithms · Computer Science
A Near Optimal Approximation Algorithm for Vertex-Cover Problem
Deepak Puthal
2013-09-20
Data Structures and Algorithms · Computer Science
Constraint Minimum Vertex Cover in K Partite Graph, Approximation Algorithm and Complexity Analysis
Kamanashis Biswas, S. A. M. Harun
2009-09-02
Data Structures and Algorithms · Computer Science
Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
Sam Chiu-wai Wong
2017-01-24
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Edge Partitioned Vertex Cover Problems
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
2015-03-19
Computational Complexity · Computer Science
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
Sushant Sachdeva, Rishi Saket
2011-05-24
Computational Complexity · Computer Science
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2007-05-23
Data Structures and Algorithms · Computer Science
Top-k Overlapping Densest Subgraphs: Approximation and Complexity
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis
2019-01-31
Computational Complexity · Computer Science
Some Results on Approximability of Minimum Sum Vertex Cover
Aleksa Stanković
2022-12-23
Data Structures and Algorithms · Computer Science
On the approximability of the vertex cover and related problems
Qiaoming Han, Abraham P. Punnen
2007-12-21
Data Structures and Algorithms · Computer Science
Approximating Subdense Instances of Covering Problems
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010-11-10
Computational Complexity · Computer Science
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
Vangelis Th. Paschos
2019-09-19
Computational Complexity · Computer Science
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2009-08-28
Data Structures and Algorithms · Computer Science
Edge covering with budget constrains
Rajiv Gandhi, G. Kortsarz
2013-11-05
Computational Complexity · Computer Science
A (1.999999)-approximation ratio for vertex cover problem
Majid Zohrehbandian
2025-03-04
Social and Information Networks · Computer Science
Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications
Hung Nguyen, Phuc Thai, My Thai, Tam Vu +1
2019-01-24
Data Structures and Algorithms · Computer Science
Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
2026-04-16
Data Structures and Algorithms · Computer Science
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
Dekel Tsur
2018-12-31
Optimization and Control · Mathematics
On solving the densest $k$-subgraph problem on large graphs
Renata Sotirov
2019-01-21
Computational Complexity · Computer Science
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Manuel Sorge
2013-06-28
Data Structures and Algorithms · Computer Science
Packing-Based Approximation Algorithm for the k-Set Cover Problem
Martin Furer, Huiwen Yu
2015-03-03
Combinatorics · Mathematics
Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover
Tuukka Korhonen
2020-11-24
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Probabilistic Graphs
Kai Han
2018-07-10
Data Structures and Algorithms · Computer Science
An Optimal Algorithm for Stochastic Vertex Cover
Jan van den Brand, Inge Li Gørtz, Chirag Pabbaraju, Debmalya Panigrahi +4
2026-03-31