Author:
Bhattacharya Binay,Kameda Tsunehiko
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS Journal of Computing 12(2), 104–110 (2000)
2. Averbakh, I., Berman, O.: An improved algorithm for the minmax regret median problem on a tree. Networks 41, 97–103 (2003)
3. Brodal, G.S., Georgiadis, L., Katriel, I.: An O(n logn) version of the Averbakh–Berman algorithm for the robust median of a tree. Operations Research Letters 36, 14–18 (2008)
4. Burkard, R.E., Dollani, H.: Robust location problems with pos/neg-weights on a tree. Tech. Rep. Diskrete Optimierung Bericht Nr. 148, Karl-Franzens-Universiät Graz & Technische Universiät Graz (1999)
5. Burkard, R., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60, 193–215 (1998)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献