599 search results - page 48 / 120 » The repeater tree construction problem |
141
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
179
click to vote
FOCS
2006
IEEE
16 years 1 days ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
179
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
156
click to vote
EVOW
2007
Springer
16 years 5 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
140
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...