Exact and Approximation Algorithms for Linear Arrangement Problems.
Alain QuilliotDjamal RebainePublished in: FedCSIS (2014)
Keyphrases
- approximation algorithms
- vertex cover
- approximation schemes
- randomized algorithms
- np hard
- np hardness
- special case
- primal dual
- exact algorithms
- optimization problems
- network design problem
- worst case
- minimum cost
- set cover
- quadratic program
- practical problems
- precedence constraints
- mathematical programming
- simulated annealing
- disjoint paths