434 search results - page 45 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
AUSNet is a functional network of autonomous undersea vehicles. We present two novel algorithms to enhance AUSNet. In live inwater testing, a packet queueing problem in which stal...
102
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
ESCAPE
2007
Springer
15 years 3 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
100
click to vote
DAC
2008
ACM
16 years 24 days ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
108
click to vote
JCM
2007
14 years 11 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...