Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
Rolf KleinChristian KnauerGiri NarasimhanMichiel H. M. SmidPublished in: ISAAC (2005)
Keyphrases
- approximation algorithms
- disjoint paths
- np hard
- marginal probabilities
- special case
- worst case
- facility location problem
- minimum cost
- vertex cover
- primal dual
- randomized algorithms
- approximation schemes
- network design problem
- homology generators
- approximation ratio
- exact algorithms
- mathematical morphology
- binary images
- open shop
- constant factor approximation
- constant factor
- set cover
- precedence constraints
- np hardness
- undirected graph
- shortest path
- objective function
- genetic algorithm