A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership
type: Item
instance of: scholarly article
title: A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership
zbMATH Open document ID: 1191.68070
author: Mira Gonen
author: Yuval Shavitt
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5721968
zbMATH Keywords: internet
zbMATH Keywords: measurement systems
zbMATH Keywords: traceroute
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.09.023
OpenAlex ID: W2107895255
cites work: On the bias of traceroute sampling
cites work: Algorithmic construction of sets for k -restrictions
cites work: A threshold of ln n for approximating set cover
cites work: Approximation algorithms for combinatorial problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Q4527015
cites work: Q4234073
cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs
DOI: 10.1016/J.IPL.2008.09.023
description: scientific article; zbMATH DE number 5721968