%0 Conference Paper %1 conf/isaac/XuX09 %A Xu, Zhou %A Xu, Liang %B ISAAC %D 2009 %E Dong, Yingfei %E Du, Ding-Zhu %E Ibarra, Oscar H. %I Springer %K dblp %P 383-392 %T Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#XuX09 %V 5878 %@ 978-3-642-10630-9

@inproceedings{conf/isaac/XuX09, added-at = {2017-11-09T00:00:00.000+0100}, author = {Xu, Zhou and Xu, Liang}, biburl = {https://www.bibsonomy.org/bibtex/28c3d5a1a063d5713c57e4624e04fb977/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2009}, editor = {Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar H.}, ee = {https://doi.org/10.1007/978-3-642-10631-6_40}, interhash = {65d1cd93972891bef7c0ed8428d91f87}, intrahash = {8c3d5a1a063d5713c57e4624e04fb977}, isbn = {978-3-642-10630-9}, keywords = {dblp}, pages = {383-392}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:56:36.000+0200}, title = {Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#XuX09}, volume = 5878, year = 2009 }