The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
We consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power...
Sibi Raj Bhaskaran, Stephen V. Hanly, Nasreen Badr...
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...