An approximation algorithm for the total cover problem
Data Structures and Algorithms
2010-08-20 v1
Authors:
Pooya Hatami
Abstract
We introduce a 2-approximation algorithm for the minimum total covering number problem.
Keywords
Cite
@article{arxiv.1008.3216,
title = {An approximation algorithm for the total cover problem},
author = {Pooya Hatami},
journal= {arXiv preprint arXiv:1008.3216},
year = {2010}
}
Comments
5 pages, 1 figure
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Forest Covers and Bounded Forest Covers
Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh
2024-11-26
Computational Complexity · Computer Science
A (1.999999)-approximation ratio for vertex cover problem
Majid Zohrehbandian
2025-03-04
Data Structures and Algorithms · Computer Science
A Near Optimal Approximation Algorithm for Vertex-Cover Problem
Deepak Puthal
2013-09-20
Discrete Mathematics · Computer Science
Approximation Algorithm for the Partial Set Multi-Cover Problem
Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson +2
2019-07-05
Data Structures and Algorithms · Computer Science
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover
Nate Veldt
2022-09-13
Data Structures and Algorithms · Computer Science
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
Samir Khuller, Uzi Vishkin, Neal Young
2015-06-02
Discrete Mathematics · Computer Science
A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing
Gang Hu
2016-10-30
Data Structures and Algorithms · Computer Science
Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Christos Koufogiannakis, Neal E. Young
2015-06-02
Data Structures and Algorithms · Computer Science
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
Andrés Fielbaum, Ignacio Morales, José Verschae
2019-12-30
Data Structures and Algorithms · Computer Science
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Felix Happach, Andreas S. Schulz
2020-01-22
Data Structures and Algorithms · Computer Science
A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
Ali Çivril
2024-07-16
Data Structures and Algorithms · Computer Science
An Approximation Algorithm for Covering Linear Programs and its Application to Bin-Packing
Eklavya Sharma
2020-12-18
Artificial Intelligence · Computer Science
Solving Minimum Vertex Cover Problem Using Learning Automata
Aylin Mousavian, Alireza Rezvanian, Mohammad Reza Meybodi
2013-12-02
Data Structures and Algorithms · Computer Science
A note on the generalized min-sum set cover problem
Martin Skutella, David P. Williamson
2011-07-12
Optimization and Control · Mathematics
A faster dual algorithm for the Euclidean minimum covering ball problem
Marta Cavaleiro, Farid Alizadeh
2022-02-23
Data Structures and Algorithms · Computer Science
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
Mohsen Ghaffari, Ce Jin, Daan Nilis
2020-05-22
Data Structures and Algorithms · Computer Science
A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'
Wei Ren, Qing Zhao
2015-03-19
Data Structures and Algorithms · Computer Science
Stochastic Minimum Vertex Cover in General Graphs: a $3/2$-Approximation
Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab
2023-02-07
Logic in Computer Science · Computer Science
Verified Approximation Algorithms
Robin Eßmann, Tobias Nipkow, Simon Robillard, Ujkan Sulejmani
2023-06-22
Distributed, Parallel, and Cluster Computing · Computer Science
A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018-05-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
Data Structures and Algorithms · Computer Science
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
2010-12-13
Computational Geometry · Computer Science
Faster Algorithm for Minimum Ply Covering of Points with Unit Squares
Siddhartha Sarkar
2023-01-31
Optimization and Control · Mathematics
A General Approximation Method for Bicriteria Minimization Problems
Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems
2017-11-16
Data Structures and Algorithms · Computer Science
Bicriteria Approximation Algorithms for the Submodular Cover Problem
Wenjing Chen, Victoria G. Crawford
2023-09-27