An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph.
Fabrizio GrandoniTomasz KociumakaMichal WlodarczykPublished in: Inf. Process. Lett. (2015)
Keyphrases
- np hard
- approximation algorithms
- linear programming
- integrality gap
- linear programming relaxation
- linear program
- knapsack problem
- primal dual
- optimal solution
- approximation schemes
- np complete
- lower bound
- special case
- worst case
- mixed integer
- integer programming
- error bounds
- feasible solution
- lp relaxation
- constant factor
- maximum error
- column generation
- dynamic programming
- lp norm
- neural network
- database schemes
- approximation error
- lot sizing
- objective function
- branch and bound