[{"author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian","id":"20792"}],"year":"2004","doi":"10.1007/s00453-004-1086-1","status":"public","date_created":"2018-04-03T05:30:23Z","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>, (3), 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>. 2004;(3):209--233. doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3 (2004): 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>.","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3, 2004, pp. 209--233, doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>.","ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” <i>Algorithmica</i>, no. 3, pp. 209--233, 2004.","bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233."},"department":[{"_id":"79"}],"page":"209--233","date_updated":"2019-01-03T13:12:48Z","type":"journal_article","user_id":"15504","issue":"3","publication":"Algorithmica","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","_id":"2119"}]