Bing Yang, S. Q. Zheng, Enyue Lu. Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function. In Hamid R. Arabnia, Pei Li Zhou, editors, Proceedings of the 2007 International Conference on Foundations of Computer Science, FCS 2007, June 25-28, 2007, Las Vegas, Nevada, USA. pages 356-361, CSREA Press, 2007.
@inproceedings{YangZL07,
title = {Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function},
author = {Bing Yang and S. Q. Zheng and Enyue Lu},
year = {2007},
researchr = {https://researchr.org/publication/YangZL07},
cites = {0},
citedby = {0},
pages = {356-361},
booktitle = {Proceedings of the 2007 International Conference on Foundations of Computer Science, FCS 2007, June 25-28, 2007, Las Vegas, Nevada, USA},
editor = {Hamid R. Arabnia and Pei Li Zhou},
publisher = {CSREA Press},
isbn = {1-60132-049-3},
}