Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.
Artur CzumajAndrzej LingasJohan NilssonPublished in: ISAAC (2003)
Keyphrases
- approximation algorithms
- optimization problems
- undirected graph
- np hard
- special case
- bounded treewidth
- minimum cost
- vertex cover
- worst case
- cost function
- facility location problem
- np complete
- approximation ratio
- approximation guarantees
- network design problem
- primal dual
- evolutionary algorithm
- upper bound
- spanning tree
- boolean functions
- metaheuristic
- graph structure
- search space
- combinatorial auctions
- disjoint paths
- directed graph
- set cover
- np hardness
- combinatorial optimization
- constant factor
- traveling salesman problem
- precedence constraints
- randomized algorithms
- approximation schemes
- constraint graph
- open shop
- space complexity
- polynomial time approximation
- knapsack problem