666 search results - page 94 / 134 » New primal-dual algorithms for Steiner tree problems |
177
click to vote
DASFAA
2007
IEEE
16 years 16 days ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
149
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
143
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
167
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
201
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...