Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs.
Steven ChaplickMartin FrohnSteven KelkJohann LottermoserMatús MihalákPublished in: CoRR (2024)
Keyphrases
- greedy algorithm
- maximum independent set
- approximation ratio
- graph theory
- independent set
- graph theoretic
- greedy algorithms
- approximation guarantees
- approximation algorithms
- objective function
- worst case
- greedy strategy
- dynamic programming
- greedy heuristic
- set cover
- greedy approximation algorithm
- randomized algorithm
- knapsack problem
- influence maximization
- submodular functions
- upper bound
- search algorithm