The Annals of Applied Statistics

Discussion of “Network routing in a dynamic environment”

Andrew C. Thomas and Stephen E. Fienberg

Full-text: Open access

Article information

Source
Ann. Appl. Stat., Volume 5, Number 2B (2011), 1425-1427.

Dates
First available in Project Euclid: 13 July 2011

Permanent link to this document
https://projecteuclid.org/euclid.aoas/1310562727

Digital Object Identifier
doi:10.1214/11-AOAS453A

Mathematical Reviews number (MathSciNet)
MR2849780

Zentralblatt MATH identifier
05961671

Citation

Thomas, Andrew C.; Fienberg, Stephen E. Discussion of “Network routing in a dynamic environment”. Ann. Appl. Stat. 5 (2011), no. 2B, 1425--1427. doi:10.1214/11-AOAS453A. https://projecteuclid.org/euclid.aoas/1310562727


Export citation

References

  • Andreatta, G. and Romeo, L. (1988). Stochastic shortest paths with recourse. Networks 18 193–204.
  • Bar-Noy, A. and Schieber, B. (1991). The Canadian traveller problem. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms 261–270. ACM, New York.
  • Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks 1 215–239.
  • Garthwaite, P. H., Kadane, J. B. and O’Hagan, A. (2005). Statistical methods for eliciting probability distributions. J. Amer. Statist. Assoc. 100 680–701.
  • Papadimitriou, C. H. and Yannakakis, M. (1991). Shortest paths without a map. Theoret. Comput. Sci. 84 127–150.
  • Thomas, A. C. and Fienberg, S. E. (2011). Exploring the consequences of IED deployment with a generalized linear model implementation of the Canadian traveller problem. Unpublished manuscript, Carnegie Mellon Univ.