Minimum fill-in: Inapproximability and almost tight lower bounds.
Yixin CaoR. B. SandeepPublished in: Inf. Comput. (2020)
Keyphrases
- lower bound
- upper bound
- constant factor
- approximation algorithms
- branch and bound algorithm
- np hard
- worst case
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- upper and lower bounds
- minimum cost
- lower bounding
- neural network
- min sum
- quadratic assignment problem
- running times
- special case
- sample complexity
- data structure
- optimal cost
- data sets
- set of randomly generated instances