Approximation Algorithms for the Maximum Acyclic Subgraph Problem.
Bonnie BergerPeter W. ShorPublished in: SODA (1990)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- np complete
- optimal solution
- scheduling problem
- vertex cover
- lower bound
- worst case
- facility location problem
- network design problem
- integer programming
- np hardness
- primal dual
- constant factor
- linear programming
- approximation ratio
- set cover
- computational complexity
- branch and bound algorithm
- greedy heuristic
- precedence constraints
- knapsack problem
- randomized algorithms
- constraint satisfaction problems
- open shop
- approximation schemes