vix.ing · top · new · best · stats · spec

Greed is good: Approximating independent sets in sparse and bounded-degree graphs

1997/05/01 by Magnús M. Halldórsson, M. M. Halldórsson, Jaikumar Radhakrishnan +1 · 1 citation
Computer Science · Mathematics · #Algorithm #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Degree (music) #Discrete mathematics #Function (biology) #Generalization #Graph #Greedy algorithm #Independent set #Machine Learning and Algorithms #Mathematics #Preprocessor #Simple (philosophy) #Stochastic Gradient Optimization Techniques #Upper and lower bounds

paper · doi:10.1007/bf02523693

crossref issued 1997/05/01 · crossref published 1997/05/01 · crossref published-print 1997/05/01 · openalex publication_date 1997/05/01 · crossref created 2006/11/08 · crossref deposited 2019/05/19 · openalex created_date 2025/10/10 · crossref indexed 2026/03/12 · openalex updated_date 2026/07/23

Citations

Cited by