Simple on-line algorithms for the maximum disjoint paths problem

P. Kolman, C. Scheideler, in:, SPAA, 2001, pp. 38–47.

Download
OA 335.17 KB
URN
Conference Paper
Author
Publishing Year
Proceedings Title
SPAA
Page
38--47
LibreCat-ID

Cite this

Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA.; 2001:38-47.
Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38–47).
@inbook{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38–47}}
Kolman, Petr, and Christian Scheideler. “Simple on-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38–47, 2001.
P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38–47.
Kolman, Petr, and Christian Scheideler. “Simple on-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA. N.p., 2001. 38–47. Print.
Main File(s)
File Name
335.17 KB
Access Level
OA Open Access
Last Uploaded
2018-04-12T08:58:07Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar