496 search results - page 5 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
CCCG
2007
13 years 9 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
CPM
2000
Springer
13 years 12 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
CCCG
2006
13 years 9 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
WADS
2007
Springer
14 years 1 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...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...