4894 search results - page 38 / 979 » The Guarding Problem - Complexity and Approximation |
JGO
2010
14 years 9 months ago
2010
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
CPM
2000
Springer
15 years 3 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...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
112
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
JC
2007
14 years 11 months ago
2007
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...