M. M. Halldórsson
- 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