Approximation algorithms for labeling hierarchical taxonomies.
Yuval RabaniLeonard J. SchulmanChaitanya SwamyPublished in: SODA (2008)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- set cover
- worst case
- minimum cost
- approximation ratio
- network design problem
- active learning
- np hardness
- approximation schemes
- constant factor
- exact algorithms
- precedence constraints
- randomized algorithms
- open shop
- constant factor approximation
- concept hierarchy
- strongly np hard