A 6/5-approximation algorithm for the maximum 3-cover problem
type: Item
instance of: scholarly article
title: A 6/5-approximation algorithm for the maximum 3-cover problem
zbMATH Open document ID: 1269.90090
author: I. Caragiannis
author: Gianpiero Monaco
published in: Journal of Combinatorial Optimization
publication date: 2013-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6151673
zbMATH Keywords: maximum cover
zbMATH Keywords: set packing
zbMATH Keywords: approximation algorithms
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: s10878-011-9417-z
OpenAlex ID: W1965619131
cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee
cites work: Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections
cites work: Complexity of approximating bounded variants of optimization problems
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Q4526990
cites work: A threshold of ln n for approximating set cover
cites work: Approximation algorithms for partial covering problems
cites work: Q4886045
cites work: On the complexity of approximating \(k\)-set packing
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
DOI: 10.1007/S10878-011-9417-Z
description: scientific article; zbMATH DE number 6151673