Textbook and Readings
Textbook:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT
Press, 3rd edition, 2009. The university bookstore carries this book, which is a required textbook for this course. The
book is very popular and there are many resources on the Web. These resources include solutions to exercises by the
authors and others, video lectures and tutorials, and more. You are welcome, and encouraged, to use these resources
(unless specifically directed otherwise), and to share and discuss them with classmates on the newsgroup. However,
you must prominently attribute any help from such or other resources in all your work. Failure to do so is a serious
offense (see policies).
Readings:
A few supplemental readings will be added here based on class preferences.
-
1.
- Pam A. Mueller and Daniel M. Oppenheimer. The pen is mightier than the keyboard: Advantages of
longhand over laptop note taking. Psychological Science, 25(6):1159–1168, 2014. PMID: 24760141.
-
2.
- Moritz Baum, Julian Dibbelt, Dorothea Wagner, and Tobias Zündorf. Modeling and Engineering
Constrained Shortest Path Algorithms for Battery Electric Vehicles. In Kirk Pruhs and Christian
Sohler, editors, 25th Annual European Symposium on Algorithms (ESA 2017), volume 87 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 11:1–11:16, Dagstuhl, Germany, 2017. Schloss
Dagstuhl–Leibniz-Zentrum fuer Informatik.
-
3.
- Amariah Becker, Philip N. Klein, and David Saulpic. A Quasi-Polynomial-Time Approximation
Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. In Kirk Pruhs and Christian
Sohler, editors, 25th Annual European Symposium on Algorithms (ESA 2017), volume 87 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 12:1–12:15, Dagstuhl, Germany, 2017. Schloss
Dagstuhl–Leibniz-Zentrum fuer Informatik.