Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds.
Yixin CaoR. B. SandeepPublished in: CoRR (2016)
Keyphrases
- lower bound
- upper bound
- constant factor
- approximation algorithms
- branch and bound algorithm
- np hard
- worst case
- minimum cost
- branch and bound
- lower and upper bounds
- optimal solution
- upper and lower bounds
- objective function
- lower bounding
- running times
- lagrangian relaxation
- vc dimension
- randomly generated problems
- min sum
- quadratic assignment problem
- cost function
- machine learning