Postgraduate
lesson: Combinatorial Optimization |
Bibliography |
1.
C. PAPADIMITRIOU, K. STEIGLITZ, Combinatorial Optimization,
Prentice-Hall, 1982.
2.
R. MONTWANI & P. RAGHAVAN, Randomized Algorithms, Cambridge
university press, 1995.
3.
E. AARTS & J.-K. LENSTRA, Local Search in Combinatorial
Optimization, John Wiley & Sons, 1997.
4.
Th. H. CORMEN, CH. E. LEISERSON, R.L. RIVEST, Introduction to
algorithms, MIT-Press, 2000.
5.
L. LOV\'ASZ, Combinatorial Problems and Exercises, 2nd Ed.,
Budapest, 1993.
6.
M.R. GAREY & D.S. JOHNSON, Computers and Intractability: A guide
to the theory of NP-completeness, W.H. Freeman and company, 1979.
7.
E. AARTS & KORST, Simulated Annealing and Boltzmann Machines,
John Wiley & Sons, 1989.
8.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela,
M. Protasi, Complexity and Approximation, Springer-Verlag, 1999.
9.
Vijay V. Vazirani, Approximation Algorithms, 1st Edition,
Springer Verlag, 2001.
10.
Laurence A. Wolsey, George L. Nemhauser, Integer and Combinatorial
Optimization, 1st Edition, Wiley Interscience, 1999.
11.
Survey. M.X. Goemans and D.P.
Williamson, The Primal-Dual Method for Approximation Algorithms
and its Application to Network Design Problems, in
Approximation Algorithms, D. Hochbaum, Ed., 1997.