Approximation algorithms for maximum linear arrangement.
Refael HassinShlomi RubinsteinPublished in: Inf. Process. Lett. (2001)
Keyphrases
- approximation algorithms
- constant factor approximation
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- facility location problem
- network design problem
- primal dual
- precedence constraints
- np hardness
- randomized algorithms
- constant factor
- exact algorithms
- approximation ratio
- disjoint paths
- quadratic program
- integrality gap
- open shop
- approximation guarantees
- set cover
- undirected graph
- lower bound
- theoretical analysis