A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Svatopluk PoljakDaniel TurzíkPublished in: Discret. Math. (1986)
Keyphrases
- optimization problems
- combinatorial optimization
- evolutionary algorithm
- metaheuristic
- satisfy the triangle inequality
- cost function
- objective function
- optimal planning
- simulated annealing
- tabu search
- worst case
- special case
- traveling salesman problem
- combinatorial optimization problems
- computational complexity
- exact algorithms
- knapsack problem
- heuristic methods
- optimal solution
- computationally tractable
- candidate solutions
- solution quality
- search strategies
- graph mining
- approximation algorithms
- heuristic search
- dynamic programming
- multi objective
- search algorithm