434 search results - page 17 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
122
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
115
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
122
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
126
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
125
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...