Approximation algorithms for multi-parameter graph optimization problems.
Ivan BasovAlek VainshteinPublished in: Discret. Appl. Math. (2002)
Keyphrases
- approximation algorithms
- optimization problems
- undirected graph
- np hard
- constant factor
- disjoint paths
- special case
- vertex cover
- evolutionary algorithm
- worst case
- facility location problem
- network design problem
- minimum cost
- cost function
- objective function
- planar graphs
- primal dual
- knapsack problem
- randomized algorithms
- open shop
- set cover
- approximation ratio
- precedence constraints
- metaheuristic
- np hardness
- random walk
- approximation schemes
- polynomial time approximation
- directed graph
- graph model
- directed acyclic graph
- graph structure
- constant factor approximation
- learning algorithm
- integrality gap
- connected components
- feasible solution
- spanning tree
- weighted graph