Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study.
Mathias BauerPublished in: Int. J. Approx. Reason. (1997)
Keyphrases
- approximation algorithms
- decision making
- special case
- np hard
- worst case
- minimum cost
- vertex cover
- primal dual
- decision makers
- set cover
- network design problem
- facility location problem
- approximation ratio
- open shop
- approximation schemes
- randomized algorithms
- exact algorithms
- constant factor
- np hardness
- combinatorial auctions
- linear programming
- disjoint paths
- precedence constraints
- strongly np hard
- lower bound