Polynomial-time Approximation of Independent Set Parameterized by Treewidth.
Parinya ChalermsookFedor V. FominThekla HammTuukka KorhonenJesper NederlofLy OrgoPublished in: CoRR (2023)
Keyphrases
- independent set
- polynomial time approximation
- np hard
- approximation algorithms
- error bounds
- upper bound
- search space
- bounded treewidth
- maximum weight
- maximum independent set
- space complexity
- lower bound
- identical machines
- bin packing
- optimal solution
- knapsack problem
- minimum cost
- metaheuristic
- worst case
- query processing
- computational complexity