Notes
1. www.nps.gov/nhl/DOE_dedesignations/Telephone.htm.
2. “A Brief History of Con Edison: Electricity,” conEdison, www.coned.com/history/electricity.asp.
3. Bernhard Burgstaller and Friedrich Pillichshammer, “The Average Distance Between Two Points,” www.math.uni-muenster.de/reine/u/burgstal/d18.pdf.
4. Bob Briscoe, Andrew Odlyzko, and Benjamin Tilly, “Metcalfe’s Law Is Wrong,” IEEE Spectrum (July 2006), http://spectrum.ieee.org/computing/networks/metcalfes-law-is-wrong; Joe Weinman, “Is Metcalfe’s Law Way Too Optimistic,” Business Communications Review (August 2007), pp. 18–27. www.joeweinman.com/Resources/WeinmanMetcalfe.pdf.
5. Duncan Watts and Steven Strogatz, “Collective Dynamics of ‘Small-World’ Networks,” Nature 393, No. 6684 (1998): 440–442; Albert-László Barabási, Linked: How Everything Is Connected to Everything Else and What It Means (Plume, 2003).
6. George J. Stigler, “The Economics of Information,” Journal of Political Economy 69, No. 3 (June 1961), pp. 213–225.
7. The actual rate of decline depends on the distribution of prices—a uniform distribution is assumed here.
8. “‘Virgin Mary’ Toast Fetches $28,000,” BBC, November 23, 2004. http://news.bbc.co.uk/2/hi/4034787.stm.
9. Joe Weinman, “Cloud Computing Is NP-Complete,” February 1, 2011. www.joeweinman.com/Resources/Joe_Weinman_Cloud_Computing_Is_NP-Complete.pdf.
10. Note that if there are even just two locations, the problem is at least weakly NP-complete due to a straightforward transformation to PARTITION, ...
Get Cloudonomics: The Business Value of Cloud Computing, + Website now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
