A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership

DOI10.1016/j.ipl.2008.09.023zbMath1191.68070OpenAlexW2107895255MaRDI QIDQ976067

Yuval Shavitt, Mira Gonen

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.023

zbMATH Keywords

approximation algorithmsinternetmeasurement systemstraceroute

Mathematics Subject Classification ID

Database theory (68P15) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• On the bias of traceroute sampling

This page was built for publication: A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership