%0 Conference Paper %1 conf/icc/LeepilaOK11 %A Leepila, Ruchaneeya %A Oki, Eiji %A Kishi, Naoto %B ICC %D 2011 %I IEEE %K dblp %P 1-5 %T Scheme to Find k Disjoint Paths in Multi-Cost. %U http://dblp.uni-trier.de/db/conf/icc/icc2011.html#LeepilaOK11 %@ 978-1-61284-232-5

@inproceedings{conf/icc/LeepilaOK11, added-at = {2011-12-08T00:00:00.000+0100}, author = {Leepila, Ruchaneeya and Oki, Eiji and Kishi, Naoto}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26a1b35a88e6d87dcb4665c1691aea705/dblp}, booktitle = {ICC}, crossref = {conf/icc/2011}, ee = {http://dx.doi.org/10.1109/icc.2011.5962477}, interhash = {13f741189f49f72fd67d829116f7aac2}, intrahash = {6a1b35a88e6d87dcb4665c1691aea705}, isbn = {978-1-61284-232-5}, keywords = {dblp}, pages = {1-5}, publisher = {IEEE}, timestamp = {2016-02-02T13:46:51.000+0100}, title = {Scheme to Find k Disjoint Paths in Multi-Cost.}, url = {http://dblp.uni-trier.de/db/conf/icc/icc2011.html#LeepilaOK11}, year = 2011 }