Implicitly Representing Arrangements of Lines or Segments.
Improved Bounds on Weak e-Nets for Convex Sets.
Improved lower bounds on the approximability of the traveling salesman problem
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
This paper deals with lower bounds on the approximability of different subproblems of the Traveling Salesman Problem (TSP) which is known not to admit any polynomial time approximation algorithm in general (unless ). First of all, we present an improved lower bound for the Traveling Salesman Problem with Triangle Inequality, Delta-TSP for short. Moreover our technique, an extension of the method of Engebretsen [11], also applies to the case of relaxed and sharpened triangle inequality, respectively,...
Incremental DFA minimisation
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.
INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs
Infinite pseudo-random sequences of high algorithmic complexity
Informal proofs formally checked by machine
Information et complexité
Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.