Learning-augmented maximum independent set
From MaRDI portal
Cites work
- A 3-approximation algorithm for maximum independent set of rectangles
- A combinatorial multi-armed bandit approach to correlation clustering
- Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
- Approximating Maximum Clique by Removing Subgraphs
- Approximating maximum independent sets by excluding subgraphs
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Concentration of Measure for the Analysis of Randomized Algorithms
- Exact Algorithms for Maximum Independent Set
- Fast algorithms for max independent set
- Fast local search for the maximum independent set problem
- Graph searching with predictions
- scientific article; zbMATH DE number 2089367 (Why is no real title available?)
- scientific article; zbMATH DE number 7740914 (Why is no real title available?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maximum independent set of rectangles
- Measure and conquer
- On approximating maximum independent set of rectangles
- On dynamic graph algorithms with predictions
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- The Maximum Independent Set Problem in Planar Graphs
- Why is maximum clique often easy in practice?
Cited in
(1)
This page was built for publication: Learning-augmented maximum independent set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920819)
