Pulse nav.journalClub Debates activos Tendencias Explorar Investigadores

Download the App

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

© Synapse Social LLC, 2026

Política de privacidad

Inicio Explorar nav.journalClub Tendencias

⌘+K

A tight analysis of the greedy algorithm for set cover | Synapse

January 1, 1996Open Access

A tight analysis of the greedy algorithm for set cover

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set cover.

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Petr Slavı́k (Mon,) studied this question.

synapsesocial.com/papers/6a0eed9e1c5e2d2319fa19aa https://doi.org/https://doi.org/10.1145/237814.237991

Me gusta

Guardar

Compartir

Ver artículo completo

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A threshold of ln <i>n</i> for approximating set cover (preliminary version)1996 · 213 citations
2Computers and Intractability: A Guide to the Theory of NP-Completeness1979 · 44,611 citations
3Approximating set cover via local improvements1995 · 4 citations
4On the ratio of optimal integral and fractional covers1975 · 1,130 citations
5Reducibility among Combinatorial Problems1972 · 10,966 citations