Author:
Bhattacharya Binay,Golin Mordecai J.,Higashikawa Yuya,Kameda Tsunehiko,Katoh Naoki
Publisher
Springer International Publishing
Reference18 articles.
1. Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path (2014). arXiv:1404,5448v1
2. Lecture Notes in Computer Science;R Benkoczi,2003
3. Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret sinks on path and tree networks. Theoretical Computer Science 607, 411–425 (2015)
4. Lecture Notes in Computer Science;S-W Cheng,2013
5. Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations research 6(3), 419–433 (1958)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献