Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/isaac/KamiyamaK09
%A Kamiyama, Naoyuki
%A Katoh, Naoki
%B ISAAC
%D 2009
%E Dong, Yingfei
%E Du, Ding-Zhu
%E Ibarra, Oscar H.
%I Springer
%K dblp
%P 802-811
%T A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.
%U http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#KamiyamaK09
%V 5878
%@ 978-3-642-10630-9
@inproceedings{conf/isaac/KamiyamaK09,
added-at = {2017-05-19T00:00:00.000+0200},
author = {Kamiyama, Naoyuki and Katoh, Naoki},
biburl = {https://www.bibsonomy.org/bibtex/26a3dd66582d24b2b9df274635e0e1ae4/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_81},
interhash = {33dfef09cfd68e1d66e2571cf8618b52},
intrahash = {6a3dd66582d24b2b9df274635e0e1ae4},
isbn = {978-3-642-10630-9},
keywords = {dblp},
pages = {802-811},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T12:56:36.000+0200},
title = {A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.},
url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2009.html#KamiyamaK09},
volume = 5878,
year = 2009
}