We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
By its dual representation, a developable surface can be viewed as a curve of dual projective 3-space. After introducing an appropriate metric in the dual space and restricting ou...