Replica Placement via Capacitated Vertex Cover.

Sonika Arora Venkatesan T. Chakaravarthy Neelima Gupta Koyel Mukherjee Yogish Sabharwal

Published in: FSTTCS (2013)

Keyphrases

vertex cover
approximation algorithms
np hard
precedence constraints
partial order
lot sizing
planar graphs
routing problem
special case
optimality criterion
polynomial time approximation
integer programming
minimum cost
search algorithm
knapsack problem