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