134
Voted
WADS
15 years 8 months ago
2007 Springer 
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
136
Voted
WADS
15 years 8 months ago
2007 Springer 
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
107
Voted
WADS
15 years 8 months ago
2007 Springer 
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
146
Voted
WADS
15 years 8 months ago
2007 Springer 
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
147
Voted
WADS
15 years 8 months ago
2007 Springer 
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
|
Algorithms