434 search results - page 33 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
SODA
1990
ACM
15 years 28 days ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
100
click to vote
STOC
2009
ACM
16 years 11 days ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
101
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
117
click to vote
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...