Pages that link to "Item:Q679458"
From MaRDI portal
The following pages link to Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458):
Displayed 8 items.
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Filtering algorithms for the NValue constraint (Q857887) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks (Q3431447) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)