Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization
Frank NeumannMarco LaumannsPublished in: Electron. Colloquium Comput. Complex. (2005)
Keyphrases
- approximation algorithms
- np hard
- multi objective optimization
- vertex cover
- np hardness
- multi objective
- special case
- evolutionary algorithm
- np complete
- approximation schemes
- worst case
- set cover
- minimum cost
- randomized algorithms
- optimization problems
- polynomial time approximation
- multi objective optimization problems
- approximation ratio
- optimal solution
- integer programming
- combinatorial optimization problems
- pareto optimal set
- multiple objectives
- primal dual
- greedy heuristic
- knapsack problem
- scheduling problem
- multi objective genetic algorithm
- test problems
- constant factor
- combinatorial optimization
- neural network
- branch and bound algorithm
- metaheuristic
- simulated annealing
- dynamic programming
- genetic algorithm