Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.
Frank NeumannMarco LaumannsPublished in: LATIN (2006)
Keyphrases
- approximation algorithms
- np hard
- multi objective optimization
- np hardness
- vertex cover
- np complete
- special case
- multi objective
- approximation schemes
- worst case
- evolutionary algorithm
- randomized algorithms
- minimum cost
- set cover
- approximation ratio
- scheduling problem
- multi objective optimization problems
- primal dual
- multi objective problems
- optimal solution
- linear programming
- lower bound
- pareto optimal set
- constant factor approximation
- constant factor
- bi objective
- approximation guarantees
- greedy heuristic
- multi objective evolutionary algorithms
- efficient solutions
- pareto optimal
- integer programming
- genetic algorithm