Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
We consider the standard semidefinite programming (SDP) relaxation for vertex cover to which all hypermetric inequalities supported on at most k vertices have been added. We show t...
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....