Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.
Junran LichenJianping LiKo-Wei LihPublished in: Optim. Lett. (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- longest common subsequence
- facility location problem
- vertex cover
- open shop
- stock market
- network design problem
- approximation ratio
- set cover
- constant factor
- np hardness
- precedence constraints
- undirected graph
- bounded degree
- long run
- computational complexity
- combinatorial auctions
- scheduling problem
- lower bound