Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs

DOI10.1007/978-3-540-74240-1_6zbMath1135.68640OpenAlexW1629104677MaRDI QIDQ5444947

Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_6

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (3)

An Improved Approximation Bound for Spanning Star Forest and Color Saving ⋮ A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem ⋮ Covering the edges of bipartite graphs using \(K_{2,2}\) graphs

This page was built for publication: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs