Packing-Based Approximation Algorithm for the k-Set Cover Problem

DOI10.1007/978-3-642-25591-5_50zbMath1350.68290arXiv1109.3418OpenAlexW1496354680MaRDI QIDQ3104644

Huiwen Yu, Martin Fuerer

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.3418

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (5)

Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints ⋮ Tight approximation bounds for combinatorial frugal coverage algorithms ⋮ Approximating activation edge-cover and facility location problems ⋮ Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints ⋮ Unnamed Item

This page was built for publication: Packing-Based Approximation Algorithm for the k-Set Cover Problem