51 search results - page 3 / 11 » approx 2008 |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
COMPUTING
2006
13 years 5 months ago
2006
In his paper "Lagrange interpolation on Chebyshev points of two variables" (J. Approx. Theor. 87, 220
ICOM
2002
13 years 5 months ago
2002
: GI is the main informatics society in the German speaking countries. It has approx. 22.000 members. This paper describes the HCI related technical committee as part of GI, its SI...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...