Year: 2011
Type: preprint
Abstract: More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
Source: arXiv (Cornell University)
Author: Aslanyan, Hakob
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1600769625