434 search results - page 41 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
130
click to vote
DKE
2007
14 years 11 months ago
2007
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
120
click to vote
SODA
1992
ACM
15 years 28 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
103
Voted
STOC
2006
ACM
16 years 2 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
EOR
2006
14 years 11 months ago
2006
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
IJAIT
2010
14 years 10 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...