Polynomial Time and Parameterized Approximation Algorithms for Boxicity.

Abhijin Adiga Jasine Babu L. Sunil Chandran

Published in: IPEC (2012)

Keyphrases

approximation algorithms
special case
np hard
worst case
approximation ratio
vertex cover
minimum cost
facility location problem
np hardness
network design problem
exact algorithms
set cover
undirected graph
approximation schemes
open shop
constant factor
disjoint paths
primal dual
combinatorial auctions