[{"user_id":"15504","ddc":["040"],"page":"38--47","urn":"21421","_id":"2142","date_updated":"2022-01-06T06:54:59Z","has_accepted_license":"1","status":"public","year":"2001","title":"Simple on-line algorithms for the maximum disjoint paths problem","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"relation":"main_file","date_updated":"2018-04-12T08:58:07Z","file_name":"SPAA-01.pdf","access_level":"open_access","file_size":335171,"file_id":"2301","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T08:58:07Z"}],"date_created":"2018-04-03T05:50:16Z","file_date_updated":"2018-04-12T08:58:07Z","publication":"SPAA","citation":{"ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in <i>SPAA</i>, 2001, pp. 38--47.","apa":"Kolman, P., &#38; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In <i>SPAA</i> (pp. 38--47).","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In <i>SPAA</i>, 38--47, 2001.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>SPAA</i>, 2001, pp. 38--47.","bibtex":"@inproceedings{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} }","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: <i>SPAA</i>. ; 2001:38--47."}}]