◍wovepaper
SearchResearchersInstitutions
Sign in
cs.DMJul 21, 2011
4
citations (OpenAlex)
authors
  • Hakob Aslanyan
arXiv abstractPDF
paper

Greedy Set Cover Estimations

arXiv:1107.4224

Abstract

More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.

Cited by in corpus (1)

  • Interference minimization in physical model of wireless networks
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.