This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...