Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds.
Yixin CaoR. B. SandeepPublished in: SODA (2017)
Keyphrases
- lower bound
- upper bound
- constant factor
- approximation algorithms
- branch and bound
- np hard
- branch and bound algorithm
- worst case
- optimal solution
- min sum
- objective function
- lower and upper bounds
- lower bounding
- minimum cost
- upper and lower bounds
- set of randomly generated instances
- optimal cost
- lagrangian relaxation
- sample complexity
- search algorithm
- machine learning
- database