We introduce a geometric version of the Covering Salesman Problem: Each of the salesman's clients specifies a neighborhood in which they are willing to meet the salesman.Expand

In the hitting set problem one is given m subsets of a finite set N and one has to find an X ⊂ N of minimum cardinality that “hits” (intersects) all of them.Expand

We demonstrate several structural properties of shortest routes and develop polynomial approximation algorithms that are variations of a well-known "patching" algorithm for the traveling salesman problem.Expand

We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p.Expand

In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.Expand

A push-pull amplifier consisting of a complementary pair of output transistors whose bases are interconnected by a resistor. According to the invention, the bases are separately connected to the… Expand