ScholarLens Back to search
2004•Journal of Computer and System SciencesOpen access

Approximating the dense set-cover problem

Reuven Bar-Yehuda, Zehavit Kehat

Open full text 16 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Set cover problem, Vertex cover, Cover (algebra), Bounded function, Covering problems, Combinatorics, Greedy algorithm, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Approximating the dense set-cover problem — Research Paper | ScholarLens