Sciweavers

15 search results - page 2 / 3
» On the Computer Solution of Symmetric Homogeneous Triangle I...
Sort
View
ICALP
2005
Springer
15 years 11 months ago
A Better Approximation Ratio for the Vertex Cover Problem
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...
George Karakostas
STACS
2009
Springer
16 years 19 days ago
On Approximating Multi-Criteria TSP
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...
Bodo Manthey
DCG
2010
107views more  DCG 2010»
15 years 25 days ago
An Optimization Problem Related to Minkowski's Successive Minima
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...
Romanos Malikiosis
COLT
2007
Springer
15 years 9 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
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...
CCA
2009
Springer
16 years 13 days ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
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 ...
Martin Ziegler