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

DOI10.1016/J.IPL.2008.09.023zbMATH Open1191.68070OpenAlexW2107895255MaRDI QIDQ976067FDOQ976067

Authors: Mira Gonen, Yuval Shavitt 

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

Recommendations

• A threshold of ln n for approximating set cover
• scientific article; zbMATH DE number 1256748
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Distributed set cover approximation: primal-dual with optimal locality
• Complexity and approximation of the connected set-cover problem

zbMATH Keywords

approximation algorithmsinternetmeasurement systemstraceroute

Mathematics Subject Classification ID

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

Cites Work

• A threshold of ln n for approximating set cover
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Title not available (Why is that?)
• Algorithmic construction of sets for k -restrictions
• Title not available (Why is that?)
• On the bias of traceroute sampling
• Improved Approximation Guarantees for Packing and Covering Integer Programs

Cited In (2)

• \(O(n \log n)\) procedures for tightening cover inequalities
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976067)