522 search results - page 86 / 105 » The 3-Steiner Root Problem |
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
ISCC
2007
IEEE
14 years 2 months ago
2007
IEEE
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...