Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

Petr Kolman, Christian Scheideler

Journal Title: Algorithmica

Date: 2004

Volume: 39

Issue: 3

p. 209 - 233

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cs.jhu.edu/~scheideler/papers/j_spaa01.ps.gz

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-004-1086-1

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12