Search Sciweavers | Sciweavers

74 search results - page 2 / 15

» A nature-inspired algorithm for the disjoint paths problem

click to vote

AAIM
2007
Springer

123views Algorithms» more AAIM 2007»

Efficient Algorithms for k -Disjoint Paths Problems on DAGs

13 years 9 months ago

Download homepage.fudan.edu.cn

Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...

Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu

claim paper

Read More »

click to vote

FOCS
2005
IEEE

108views Theoretical Computer Science» more FOCS 2005»

An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs

13 years 11 months ago

Download www.cs.cornell.edu

In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...

Jon M. Kleinberg

claim paper

Read More »

click to vote

SOFSEM
2009
Springer

100views Theoretical Computer Science» more SOFSEM 2009»

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

14 years 2 months ago

Download www.sofsem.cz

Torsten Tholey

claim paper

Read More »