727 search results - page 28 / 146 » Private approximation of search problems |
CPM
2008
Springer
14 years 22 days ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
NMA
2010
13 years 8 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
CEC
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
CSC
2009
14 years 1 days ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
ENDM
2008
13 years 11 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...