Sublinear approximation algorithms for boxicity and related problems.
Abhijin AdigaJasine BabuL. Sunil ChandranPublished in: Discret. Appl. Math. (2018)
Keyphrases
- approximation algorithms
- related problems
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- broadly applicable
- np hardness
- set cover
- constant factor
- open shop
- primal dual
- space complexity
- exact algorithms
- approximation schemes
- stable marriage
- randomized algorithms
- disjoint paths
- constraint satisfaction problems
- computational complexity
- learning algorithm
- constant factor approximation
- precedence constraints
- undirected graph
- integer programming