Approximation Algorithms for Maximum Linear Arrangement.
Refael HassinShlomi RubinsteinPublished in: SWAT (2000)
Keyphrases
- approximation algorithms
- np hard
- constant factor approximation
- special case
- network design problem
- vertex cover
- minimum cost
- approximation ratio
- exact algorithms
- worst case
- constant factor
- primal dual
- set cover
- quadratic program
- facility location problem
- open shop
- undirected graph
- randomized algorithms
- approximation schemes
- integrality gap
- upper bound
- theoretical analysis