An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph.
Fabrizio GrandoniTomasz KociumakaMichal WlodarczykPublished in: CoRR (2014)
Keyphrases
- np hard
- approximation algorithms
- linear programming
- integrality gap
- linear programming relaxation
- lower bound
- worst case
- linear program
- knapsack problem
- optimal solution
- primal dual
- special case
- np complete
- integer programming
- upper bound
- error bounds
- mixed integer
- feasible solution
- simplex method
- objective function
- branch and bound
- column generation
- closed form
- maximum number
- dynamic programming
- maximum weight
- arbitrarily close
- learning algorithm
- stage stochastic programs