Author:
Higashikawa Yuya,Augustine John,Cheng Siu-Wing,Golin Mordecai J.,Katoh Naoki,Ni Guanqun,Su Bing,Xu Yinfeng
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Algorithms for the robust 1-center problem on a tree;Averbakh;Eur. J. Oper. Res.,2000
2. A linear time algorithm for computing minmax regret 1-median on a tree;Bhattacharya,2012
3. An O(nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree;Brodal;Oper. Res. Lett.,2008
4. Minmax-regret robust 1-median location on a tree;Chen;Networks,1998
5. Minimax regret 1-sink location problems in dynamic path networks;Cheng,2013
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献