A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem.
Joonmo KimMihaela CardeiIonut CardeiXiaohua JiaPublished in: J. Glob. Optim. (2002)
Keyphrases
- polynomial time approximation
- np hard
- approximation algorithms
- error bounds
- spanning tree
- minimum cost
- web services
- bin packing
- minimum spanning tree
- identical machines
- service providers
- steiner tree
- tree structure
- service oriented
- special case
- reinforcement learning
- service discovery
- b tree
- index structure
- constant factor
- optimal solution