906 search results - page 133 / 182 » Matching Subsequences in Trees |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Directories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for Light...