Author:
Calinescu Gruia,Kapoor Sanjiv,Quinn Michael,Shin Junghwan
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56, 5:1–5:37 (2009)
2. Aumann, Y., Rabani, Y.: An O(logk) Approximate Min-Cut Max-Flow Theorem Approximation Algorithm. SIAM J. Comput. 27(1), 291–301 (1998)
3. Bell, M.G.H.: The measurement of reliability in stochastic transport networks. In: Proceedings of 2001 IEEE Intelligent Transportation Systems (2001)
4. Bohacek, S., Hespanha, J., Lee, J., Lim, C., Obraczka, K.: Game theoretic stochastic routing for fault tolerance and security in communication networks. IEEE/ACM Trans. on Parallel and Distributed Systems (2007)
5. Bohacek, S., Hespanha, J.P., Obraczka, K.: Saddle policies for secure routing in communication networks. In: Proc. of the 41st Conf. on Decision and Contr., pp. 1416–1421 (2002)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Budgeted Adversarial Network Resource Utilization Games;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2022
2. Hitting a path: a generalization of weighted connectivity via game theory;Journal of Combinatorial Optimization;2018-11-29