Absolute o( logm) error in approximating random set covering: an average case analysis

Authors:
Orestis A. Telelis;Vassilis Zissimopoulos
Affiliations:
Division of Theoretical Informatics, Department of Informatics and Telecommunications, University of Athens, Panepistimiopolis Ilissia, Athens 15784, Greece;Division of Theoretical Informatics, Department of Informatics and Telecommunications, University of Athens, Panepistimiopolis Ilissia, Athens 15784, Greece
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 1

A tight analysis of the greedy algorithm for set cover

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems

ACM Computing Surveys (CSUR)
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Statistical methods in algorithm design and analysis.

Statistical methods in algorithm design and analysis.
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

An algorithmic treatment of strong queries

Proceedings of the fourth ACM international conference on Web search and data mining

Quantified Score

Hi-index	0.89

Visualization

Abstract

This work concerns average case analysis of simple solutions for random set covering (SC) instances. Simple solutions are constructed via an O(nm) algorithm. At first an analytical upper bound on the expected solution size is provided. The bound in combination with previous results yields an absolute asymptotic approximation result of o(logm) order. An upper bound on the variance of simple solution values is calculated. Sensitivity analysis performed on simple solutions for random SC instances shows that they are highly robust, in the sense of maintaining their feasibility against augmentation of the input data with additional random constraints.