Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.
Markus ChimaniIvo HedtkeTilo WiederaPublished in: IWOCA (2016)
Keyphrases
- approximation algorithms
- np hard
- greedy heuristic
- special case
- greedy algorithm
- worst case
- vertex cover
- minimum cost
- search space
- facility location problem
- primal dual
- randomized algorithms
- open shop
- search algorithm
- np hardness
- precedence constraints
- planar graphs
- network design problem
- set cover
- undirected graph
- constant factor
- integrality gap
- optimal solution
- greedy algorithms
- approximation ratio
- integer programming
- branch and bound algorithm
- approximation schemes
- linear program
- polynomial time approximation
- computational complexity