Approximation algorithms for color spanning diameter.
Mohammad Reza KazemiAli MohadesPayam KhanteimouriPublished in: Inf. Process. Lett. (2018)
Keyphrases
- approximation algorithms
- np hard
- color images
- special case
- worst case
- vertex cover
- network design problem
- facility location problem
- minimum cost
- primal dual
- np hardness
- approximation ratio
- exact algorithms
- color space
- open shop
- constant factor
- set cover
- precedence constraints
- approximation guarantees
- combinatorial auctions