scientific article; zbMATH DE number 753971
From MaRDI portal
Publication:4698692
Recommendations
- Improved approximations of independent sets in bounded-degree graphs
- scientific article; zbMATH DE number 1003268
- On approximation properties of the independent set problem for low degree graphs
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
Cited in
(16)- Improved approximations for maximum independent set via approximation chains
- Independent sets in graphs with triangles
- Ultimate greedy approximation of independent sets in subcubic graphs
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- Independent sets in graphs
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
- Approximating Maximum Clique by Removing Subgraphs
- Bilu-Linial stability, certified algorithms and the independent set problem
- Greedy approximations of independent sets in low degree graphs
- Improved approximations of independent sets in bounded-degree graphs
- The maximum independent union of cliques problem: complexity and exact approaches
- An approximation of the minimum vertex cover in a graph
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698692)
