Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...