A new approximation algorithm for \(k\)-set cover problem
type: Item
instance of: scholarly article
title: A new approximation algorithm for \(k\)-set cover problem
zbMATH Open document ID: 1393.68188
author: Hanaa A. E. Essa
author: Yasser M. Abd El-Latif
author: S. Mohamed Ali
author: Soheir M. Khamis
published in: Arabian Journal for Science and Engineering
publication date: 2018-06-12T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6886639
zbMATH Keywords: set-cover problem
zbMATH Keywords: SCP
zbMATH Keywords: approximation algorithm
zbMATH Keywords: greedy algorithm
zbMATH Keywords: NP-complete optimization problem
MaRDI profile type: Publication
full work available at URL: s13369-015-1895-3
OpenAlex ID: W1947223152
cites work: Reducibility among Combinatorial Problems
cites work: Multiobjective Metaheuristics for the Bus Driver Scheduling Problem
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: On the ratio of optimal integral and fractional covers
cites work: A Tight Analysis of the Greedy Algorithm for Set Cover
cites work: A threshold of ln n for approximating set cover
cites work: Q4527015
cites work: A modified greedy heuristic for the set covering problem with improved worst case bound
cites work: Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
cites work: Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
DOI: 10.1007/S13369-015-1895-3
Recommended article: Packing-Based Approximation Algorithm for the k-Set Cover Problem
Recommended article: An approximation algorithm for the total covering problem
Recommended article: New complexity results for the \(k\)-covers problem
Recommended article: Approximation algorithm for the partial set multi-cover problem
Recommended article: New Approximation Algorithms for the Vertex Cover Problem
Recommended article: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
Recommended article: Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems
Recommended article: Q4526990
Recommended article: Q4843442
Recommended article: Approximation Algorithms for the k-Clique Covering Problem
description: scientific article; zbMATH DE number 6886639