BOOKS & RESOURCES
for
EECS 3101, 4101, 5101, 6114, 6118
Note: references with an
*
at the end have selected exercise solutions.
ALGORITHMS and DATA STRUCTURES
T.H. Cormen, C.E. Leiserson, R.L. Rivest,
and C. Stein,
"
Introduction to Algorithms
,"
MIT Press, (2nd ed.,
2001), (3rd ed., 2009).
*
Jeff Edmonds,
"
How to Think about Algorithms
,
"
Cambridge House Press, 2008.
*
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani,
"
Algorithms
,"
McGraw-Hill, 2008.
Jon Kleinberg and Eva Tardos,
"
Algorithm Design
,"
Addison Wesley, 2006.
Robert E. Tarjan
,
"
Data Structures and Network Algorithms
,"
CBMS44, SIAM monograph, 1983.
M.A. Weiss,
"
Data Structures and Algorithm Analysis in C++
"
, 3rd edition, Addison Wesley, 2006.
Michael Goodrich, Roberto Tamassia,
"
Algorithm Design
,"
John Wiley & Sons, 2002.
Michael Goodrich, Roberto Tamassia, Michael H. Gorlwasser,
"
Data Structures and Algorithms in Java
,"
6th edition, Wiley, 2014.
Michael X. Goemans
,
"
Advanced Algorithms
,"
MIT Technical report, 1994.
R.K. Ahuja, T.L. Magnanti. J.B. Orlin,
"
Network Flows: Theory, Algorithms, and Applications
,"
Prentice-Hall, 1993.
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman,
"
The Design and Analysis of Computer Algorithm
s
,
"
Addison Wesley, 1974.
T.C. Hu,
"
Combinatorial Algorithms
,
"
Addison-Wesley, 1982.
D.E. Knuth,
"
The Art of Computer Programming, VOL I:Fundamental Algorithms
,
"
Addison-Wesley, 1969.
*
D.E. Knuth,
"
The Art of Computer Programming, VOL III: Sorting and Searching
,
"
Addison-Wesley, 1973.
*
D.C. Kozen,
"
The Design and Analysis of Algorithms
,
"
Springer-Verlag, 1992.
*
U. Manber,
"
Introduction to Algorithms: A Creative Approach
,
"
Addison-Wesley, 1989.
*
Michael R. Garey, David S. Johnson,
"
Computers and Intractability: A Guide to the Theory of NP-Completenes
s
,
"
W.H. Freeman and Company, 1979.
OPTIMIZATION
Optimization Online
.
MOS
:
Mathematical Optimization Society.
INFORMS
:
Institute for Operations Research and the Management Sciences.
Wikipedia: Linear Programming
.
Jan Brinkhuis
, Vladimir Tikhomirov
,
``
Optimization: Insights and Applications
,"
Princeton University Press, 2005.
Stephen Boyd
,
Lieven Vandenberghe
, ``
Convex Optimization
,"
Cambridge Univ. Press, 2004.
[See Stanford
Lecture Videos
by Stephen Boyd.]
Aharon Ben-Tal
,
Arkadi Nemirovski
,
``
Lectures on Modern Convex Optimization
,"
2012.
Jiří Matoušek
,
Bernd Gartner
,
``
Understanding and Using Linear Programming
,"
Springer, 2006.
Robert J. Vanderbei
,
``
Linear Programming - Foundations and Extensions
,"
2nd edition, Springer, 2001.
Manfred Padberg,
``
Linear Optimization and Extensions
,"
Springer-Verlag, 2nd edition, 1999.
Alexander Schrijver
, ``
Theory of Linear and Integer Programming
,"
John Wiley & Sons, 2000.
Katta G. Murty,
``
Linear programming
,"
John Wiley & Sons, 1983.
Vašek Chvátal,
``
Linear Programming
,"
W.H. Freeman & Company, 1983.
George Bernard Dantzig
, ``
Linear Programming and Extensions
,"
Princeton Univ. Press, 1963.
Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial,
``
Interior Point Methods for Linear Optimization
,"
2nd edition, Springer, 2006.
Yinyu Ye
,
``
Interior Point Algorithms: Theory and Analysis
,"
Wiley Interscience, 1997.
Yurii Nesterov
,
Arkadi Nemirovski
,
``
Interior Point Methods in Convex Programming: Theory and Applications
,"
SIAM, Philadelphia, 1994.
Jon Lee, ``
A First Course in Combinatorial Optimization
,
"
Cambridge University Press, 2004.
Christos Papadimitriou
,
Kenneth Steiglitz
, ``
Combinatorial Optimization: Algorithms and Complexity
,
"
Courier Dover, 1998.
George L. Nemhaser, Laurence A. Wolsey, ``
Integer and Combinatroial Optimization
,"
Wiley Interscience, 1999.
Martin Grötschel
,
László Lovász
,
Alexander Schrijver
,
``
Geometric Algorithms and Combinatorial Optimization
,"
Springer, 1988.
Christodoulos A. Floudas, Panos M. Pardalos (editors)
,
``
Encyclopedia of Optimization
,"
2nd edition, Springer, 2009.
Dimitri P. Bertsekas, Angelia Nedic, Asuman E. Ozdaglar,
``
Convex Analysis and Optimization
,"
Athena Scientific, 2003.
Peter Manfred Gruber, Jörg M. Wills (editors),
"
Handbook of convex geometry - Volumes I & II
,"
North Holland, 1993.
Branko Grünbaum
,
``
Convex Polytopes
,"
2nd edition (prepared by Volker Kaibel, Victor Klee, Günter Ziegler), Springer, 2003.
Günter M. Ziegler
,
``
Lectures on Polytopes
,"
Graduate Texts in Mathematics
152
,
Springer
1995. Revised sixth printing 2006.
Arne Brondsted,
``
An Introduction to Convex Polytopes
,"
Springer, 1983.
Gene H. Golub, Charles F. van Loan,
``
Matrix Computations
,''
The Johns Hopkins University Press, 2nd edition 1989, or 3rd edition 2007.
Chris Godsil, Gordon Royle,
``
Algebraic Graph Theory
,
''
Springer, 2001.
Leslie Hogben (editor),
``
Handbook of Linear Algebra
,''
Chapman & Hall/CRC, 2007.
Steven Roman,
``
Advanced Linear Algebra
,''
Springer, 1992.
R.K. Ahuja, T.L. Magnanti.
J.B. Orlin
,
``
Network Flows: Theory, Algorithms, and Applications
,"
Prentice-Hall, 1993.
COMPUTATIONAL GEOMETRY
Open Problems
in Computational Geometry and related fields.
M. de Berg, O. Cheong, M. van Kreveld, M. Overmars,
"
Computational Geometry : Algorithms and Applications
,"
Springer, 3rd edition, 2008.
Siu-Wing Cheng, Tamal K. Day, Jonathan R. Shewchuk,
"
Delaunay Mesh Generation
,"
CRC Press, 2012.
Jacob E. Goodman, Joseph O'Rourke (editors),
"
Handbook of Discrete and Computational Geometry
,"
2nd edition, CRC Press LLC, 2004.
Jacob Goodman, János Pach, Emo Welzl (editors),
"
Combinatorial and Computational Geometry
,"
MSRI
, 2005.
Bernard Chazelle,
"
The Discrepancy Method - Randomness and Complexity
,"
Cambridge Univ. Press, 2000.
Joseph O'Rourke,
"
Computational Geometry in C
,"
Cambridge Univ. Press, 2nd edition, 1998.
Joseph O'Rourke,
"
Art Gallery Theorems and Algorithms
,"
Oxford Univ. Press 1987.
J-D. Boissonnat, M. Yvinec,
"
Algorithmic Geometry
,"
Cambridge Univ. Press, 1998.
D.Z. Du, F. Hwang (editors),
"
Computing in Euclidean Geometry
,"
World Scientific, 1995.
Ketan Mulmuley,
"
Computatioal Geometry - An Introduction Through Randomized Algorithms
,"
Prentice-Hall, 1994.
J
á
nos Pach (editor),
"
New Trends in Discrete and Computational Geometry
,"
Springer, 1993.
Peter Orlik, Hiroaki Terao,
"
Arrangements of Hyperplanes
,"
Springer, 1992.
Pankaj K. Agarwal,
"
Intersection and Decomposition Algorithms for Planar Arrangements
,"
Cambridge Univ. Press, 1991.
Herbert Edelsbrunner,
"
Algorithms in Combinatorial Geometry
,"
Springer,1987.
Franco Preparata, Michael Ian Shamos,
"
Computational Geometry- An Introduction
,"
Springer, 1985.
Peter Manfred Gruber, Jörg M. Wills (editors),
"
Handbook of convex geometry - Volumes I & II
,"
North Holland, 1993.
Branko Grünbaum
,
"
Convex Polytopes
,"
2nd edition (prepared by Volker Kaibel, Victor Klee, Günter Ziegler), Springer, 2003.
Günter M. Ziegler
,
"
Lectures on Polytopes
,"
Graduate Texts in Mathematics
152
,
Springer
1995. Revised sixth printing 2006.
Arne Brondsted,
"
An Introduction to Convex Polytopes
,"
Springer, 1983.
Jiří Matoušek
's
home page
has links to his excellent lecture notes.
APPROXIMATION & RANDOMIZED ALGORITHMS
Teofilo F. Gonzalez (editor),
"Handbook of Approximation Algorithms and Metaheuristics,"
Chapman & Hall/
CRC Press
, 2007.
Vijay Vazirani
,
Approximation Algorithms
, Springer, 2003.
Dorit S. Hochbaum (editor),
"
Approximation Algorithms for NP-Hard Problems
,"
PWS Publishing Company, 1997.
Michael R. Garey, David S. Johnson,
"
Computers and Intractability: A Guide to the Theory of NP-Completeness
,"
W.H. Freeman and Company, 1979.
Rajeev Motwani, Prabhakar Raghavan,
"
Randomized Algorithms
,"
Cambridge Univ. Press, 1995.
Ketan Mulmuley,
"
Computatioal Geometry - An Introduction Through Randomized Algorithms
,"
Prentice-Hall, 1994.
Bernard Chazelle,
"
The Discrepancy Method - Randomness and Complexity
,"
Cambridge Univ. Press, 2000.
MATH Miscellenia
Martin
Aigner
and
Günter M.
Ziegler
,
"
Proofs from THE BOOK
,
"
4th edition, 2010.
K.H. Rosen,
"
Discrete Mathematics and Its Applications
,
"
WCB, McGraw-Hill, 7th edition, 2012.
K.H. Rosen (editor-in-chief),
"
Handbook of Discrete and Combinatorial Mathematics
,
"
CRC Press, 2000.
R.L. Graham, D.E. Knuth, and O. Patashnik,
"
Concrete Mathematics
,"
Addison-Wesley, second edition, 1994.
*
D.H. Greene, and D.E. Knuth,
"
Mathematics For The Analysis of Algorithms
,
"
Birkhauser, 1990.
*
Gene H. Golub, Charles F. van Loan,
``
Matrix Computations
,''
The Johns Hopkins University Press, 2nd edition 1989, or 3rd edition 2007.
Jiří Matoušek
,
"
Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra
,
"
AMS, 2010.
Leslie Hogben (editor),
``
Handbook of Linear Algebra
,''
Chapman & Hall/CRC, 2007.
Steven Roman,
``
Advanced Linear Algebra
,''
Springer, 1992.
Chris Godsil, Gordon Royle,
``
Algebraic Graph Theory
,
''
Springer, 2001.
N. Hartsfield and G. Ringel,
"
Pearls in Graph Theory
,
" Academic Press,
1990.
L.W. Beineke and R.J. Wilson (editors),
"
Selected Topics in Graph Theory
,
"
AcademicPress, Vol 1 (1978), Vol 2 (1983), Vol 3 (1988).
W.T. Tutte,
"
Graph Theory
,
"
Cambridge University Press, 2001.
F. Harary,
"
Graph Theory
,
" Addison-Wesley, second edition, 1972.