csom

Here's such a map for Singapore we created quite a while ago: http://xiaoji-chen.com/2011/isochronic-singapore/ http://www.chsommer.com/isosin.htm

you may want to look at: Alternative Routes in Road Networks Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck https://www.microsoft.com/en-us/research/wp-content/uploads/...

Route Planning in Transportation Networks http://arxiv.org/abs/1504.05140

Shortest-Path Queries in Static Networks http://www.sommer.jp/spq-survey.pdf

Maybe it can predict which Microsoft lab will be closed next? ;-)

Apple, Inc., Cupertino, CA Maps C++ Software Engineer - Public Transit

As a member of the Transit Routing team, you will work on one of the most anticipated features of Apple Maps. You will design and implement functionality that will be used by millions of users worldwide. Being part of a small team, you will have an influence on the future product. You will be responsible for implementing new features and resolving complex issues. You will work on high-performance server code using C++ in a Linux environment. Work with engineers and QA to deliver high-quality routes to our customers. Challenge the status quo and improve the design of existing software. Participate in design and code reviews.

simpler than a restaurant: a coffee shop. coffee machines have been around for quite some time, they are easy to operate and they produce decent coffee. yet "the total number of coffee shops in the US increased by 70% between 2000 and 2005" [1] AI seems necessary but not sufficient for automation...

[1] http://www.marketresearchworld.net/index.php?option=com_cont...

how does it compare to, say, tabulation as in

Mihai Patrascu, Mikkel Thorup: The Power of Simple Tabulation Hashing. J. ACM 59(3): 14 (2012) http://doi.acm.org/10.1145/2220357.2220361 (free version: http://arxiv.org/abs/1011.5200)

or also

Mihai Patrascu, Mikkel Thorup: Twisted Tabulation Hashing. SODA 2013: 209-228 http://knowledgecenter.siam.org/0236-000005/

I wonder what would happen if everybody who wants Google to continue Reader would start clicking on the Ads in Reader on a daily basis. Oh wait, which ads...

Data structures called "distance oracles" handle such problems. However, most research results are for static graphs only.

If the graphs are grids (as in the cstheory.stackexchange.com question) they are planar and some dynamic data structures exist (unclear whether the constants are small enough for the application in question):

Exact shortest paths:

Jittat Fakcharoenphol, Satish Rao: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5): 868-889 (2006)

Approximate shortest paths:

Philip N. Klein, Sairam Subramanian: A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22(3): 235-249 (1998)

Ittai Abraham, Shiri Chechik, Cyril Gavoille: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218

I wonder why some of these sites would want to participate in an information exchange that seems rather asymmetric. I couldn't find detailed information on the service but I assume they have some kind of mechanism, similar to those in P2P systems, to "encourage" sites to contribute large amounts of information(?) or maybe sites can buy information without having to sell?