We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...