The multi‐integer set cover and the facility terminal cover problem

DOI10.1002/net.20265zbMath1168.90536OpenAlexW4247100793MaRDI QIDQ5191129

Asaf Levin, Dorit S. Hochbaum

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20265

zbMATH Keywords

algorithmsnetwork designapproximation algorithmsvertex coverset cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• On the hardness of approximating minimum vertex cover
• Efficient bounds for the stable set, vertex cover and set packing problems
• A fast approximation algorithm for the multicovering problem
• An improved approximation algorithm for vertex cover with hard capacities
• Covering Problems with Hard Capacities
• Linear time algorithms for approximating the facility terminal cover problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Automata, Languages and Programming

This page was built for publication: The multi‐integer set cover and the facility terminal cover problem