4110 search results - page 1 / 822 » Efficient algorithms for the 2-gathering problem |
TALG
2010
12 years 11 months ago
2010
DBPL
2007
Springer
13 years 8 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
CSC
2008
13 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CCE
2006
13 years 4 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...