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