ApproxAlgsReferences
Top
|
recent changes
|
Preferences
Difference (from prior major revision)
(no other diffs)
Added: 6a7
**
[Opportunities for Combinatorial Optimization in Computational Biology]
(NEW)
Misc.
[Search NIST dictionary of algorithms]
for terms.
[A compendium of NP optimization problems, by Crescenzi and Kann]
Lenstra's basic probability primer (
[pdf]
or
[postcript]
)
[Opportunities for Combinatorial Optimization in Computational Biology]
(NEW)
Surveys, lecture notes, theses
[lecture notes by David Willamson]
[lecture notes by Michel Goemans, MIT, Fall 1994]
[lecture notes on Approximation Algorithms for Network Problems, by Cheriyan & Ravi]
[Semidefinite programs and combinatorial optimization, by László Lovász]
[Lecture Notes on Approximation Algorithms - Volume I, by Rajeev Motwani]
[short intro to linear programming, simplex method, duality, by Samir Khuller]
Lecture notes on related topics
[Combinatorial Optimization, Goldberg and Plotkin]
[Combinatorial Optimization, Goldberg]
book chapters
[Approximation Algorithms, by Phil Klein & Neal Young]
[Computing Near-Optimal Solutions to Combinatorial Optimization Problems, by David Shmoys]
[Approximation Algorithms for Bin Packing: A Survey, E.G. Coffman, M.R. Garey, D.S. Johnson]
[The Traveling Salesman Problem: A Case Study in Local Optimization, by David Johnson and Lyle McGeoch]
books
[Approximation Algorithms, by Vijay Vazirani]
(text of
ClassW04ApproxAlgs
)
[Approximation Algorithms for NP-Hard Problems, edited by Dorit Hochbaum]
[Chapter 4: The Primal-Dual method, by Michel Goemans & David Williamson]
[Chapter 10:, Hardness of Approximations, by Sanjeev Arora & Carsten Lund]
see also
[Probabilistic Checking of Proofs and Hardness of Approximation Problems PhD by Sanjeev Arora]
[Randomized Algorithms, by Motwani and Raghavan]
[Linear Programming, by Vašek Chvátal.]
[The Probabilistic Method, by Noga Alon and Joel Spencer]
[Chapter 1: The Basic Method]
Related courses
[Algorithms for Molecular Biology, 1994-2002, Tel Aviv Univ., by Ron Shamir]
[Algorithms Seminar, Fall 2001/2, Hebrew University, by Yair Bartal]
[Approximation Algorithms, Fall 2001, Tel Aviv University, by Uri Zwick]
[Approximation Algorithms, Fall 1999, Tel Aviv University, by Uri Zwick]
[Approximation and On-Line Algorithms, Spring 2000, CMU, by Avrim Blum]
[Approximation Algorithms, Fall 1999, Univ. Waterloo, by Joseph Cheriyan]
[Approximability of Optimization Problems, MIT, Fall 1999, by Madhu Sudan]
[Topics in Mathematical Programming: Approximation Algorithms, Cornell, Spring 1999, by David Shmoys]
[Approximation Algorithms, Johns Hopkins, Fall 1998, by Lenore Cowen]
[Approximation Algorithms, Technion, Fall 1995, by Yuval Rabani]