253 search results - page 8 / 51 » Edge and Node Searching Problems on Trees |
105
click to vote
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
FLAIRS
2004
14 years 11 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
120
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
144
click to vote
COR
2011
14 years 4 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
SSDBM
2002
IEEE
15 years 2 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...