Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

Author： Kolman Petr   Scheideler Christian  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.39, Iss.3, 2004-04, pp. : 209-233

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On-Line Algorithms for the Dynamic Traveling Repair Problem: Special Issue on Scheduling

By Irani Sandy   Lu Xiangwen   Regan Amelia  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 243-258

Springer Publishing Company

Access to resources Recommend Favorite

On-line algorithms for orders

By Bouchitte V.   Rampon J.-X.  

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 225-238

Elsevier

Access to resources Recommend Favorite

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes

By Gu Q-P.   Peng S.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 6, 2000-06 ,pp. : 764-774

Academic Press

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V.   Khanna S.   Rajaraman R.   Shepherd B.   Yannakakis M.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

Access to resources Recommend Favorite

On Finding Min-Min Disjoint Paths

By Guo Longkun  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 641-653

Springer Publishing Company

Access to resources Recommend Favorite