Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth.
Artur CzumajMagnús M. HalldórssonAndrzej LingasJohan NilssonPublished in: Inf. Process. Lett. (2005)
Keyphrases
- approximation algorithms
- optimization problems
- undirected graph
- bounded treewidth
- np hard
- np complete
- worst case
- evolutionary algorithm
- vertex cover
- minimum cost
- upper bound
- special case
- metaheuristic
- facility location problem
- approximation guarantees
- primal dual
- search space
- approximation schemes
- open shop
- graph structure
- cost function
- constraint graph
- approximation ratio
- objective function
- set cover
- network design problem
- precedence constraints
- space complexity
- spanning tree
- np hardness
- traveling salesman problem
- planar graphs
- scheduling problem
- combinatorial auctions
- combinatorial optimization
- decision problems