Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias (Sinop et al. 2021)

## Summary

## Thoughts

## Notes

## Questions

### What is “Customizable route planning” in the context of Shortest path problem?

Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck. 2017. Customizable Route Planning in Road Networks. Transp. Sci. 51, 2 (2017), 566–591.

### What are “via-nodes”?

### What is the penalty method?

### What is the plateau method?

### What is “flow decomposition”?

### What is the “k-shortest path problem”?

Jin Y. Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science 17, 11 (1971), 712–716.

### Read Alternative route graphs in road networks

Roland Bader, Jonathan Dees, Robert Geisberger, and Peter Sanders. 2011. Al- ternative Route Graphs in Road Networks. In Theory and Practice of Algorithms in (Computer) Systems, Alberto Marchetti-Spaccamela and Michael Segal (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 21–32.

### What is an electrical flow in the context of Graphs?

Christos Faloutsos, Kevin S. McCurley, and Andrew Tomkins. 2004. Fast discovery of connection subgraphs. In Proceedings of the Tenth ACM SIGKDD International

### What is a Laplacian solver? And what is the significance of a near-linear one?

Daniel A. Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, László Babai (Ed.). ACM, 81–90.

### Read Choice routing

- Camvit: Choice routing. http://www.camvit.com (a).

### Read Alternative routes in road networks

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2013. Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013).

## Bibliography

*Proceedings of the 29th International Conference on Advances in Geographic Information Systems*, 282–92. Beijing China: ACM. https://doi.org/10.1145/3474717.3483961.