Approximation algorithms for general packing problems and their application to the multicast congestion problem.

Klaus Jansen Hu Zhang

Published in: Math. Program. (2008)

Keyphrases

approximation algorithms
special case
packing problem
np hard
minimum cost
worst case
open shop
randomized algorithms
facility location problem
undirected graph
routing algorithm
primal dual
precedence constraints
bin packing
congestion control
set cover
approximation ratio
scheduling problem
lower bound