Two New Approximation Algorithms for the Maximum Planar Subgraph Problem.
Timo PoranenPublished in: Acta Cybern. (2008)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- set cover
- facility location problem
- approximation schemes
- approximation ratio
- lower bound
- branch and bound algorithm
- network design problem
- np hardness
- randomized algorithms
- open shop
- precedence constraints
- integrality gap
- constant factor
- disjoint paths
- primal dual
- graph mining
- integer programming
- knapsack problem
- scheduling problem
- search space
- computational complexity