Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
Lukas BarthSara Irina FabrikantStephen G. KobourovAnna LubiwMartin NöllenburgYoshio OkamotoSergey PupyrevClaudio SquarcellaTorsten UeckerdtAlexander WolffPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- semantic representations
- approximation ratio
- minimum cost
- facility location problem
- vertex cover
- set cover
- word similarity
- word pairs
- exact algorithms
- open shop
- network design problem
- randomized algorithms
- constant factor approximation
- semantic similarity
- natural language
- cloud computing
- computational complexity
- constant factor
- co occurrence
- word sense disambiguation
- lower bound
- approximation schemes
- scheduling problem
- upper bound
- precedence constraints
- np complete
- semantic information
- information theoretic
- search space
- polynomial time approximation
- greedy algorithm
- branch and bound algorithm
- integer programming
- knapsack problem
- optimal solution