Instructor: John Lillis
email: jlillis@cs.uic.edu
Office hours (rm 936 SEO):
T,Th: 1:00-2:30
Or by appointment
(11/5/02) HW 6 (due Wed, Nov. 6): 29.2-5, 29.2-6 from CLRS.
(10/14/02) There is no class on Wednesday October 16
HW 5 (Due Wed, Oct. 30): Problem #15 from Ch. 1 of Papadimitriou and Seiglitz. You may use O(n^2) variables, but linear programs with only C(n,2) variables and any number of constraints are also of interest.
(10/14/02) Here is HW 4.
(09/26/02) HW 3 (Due Monday, Sept. 30): Problem #3 from Ch. 17 of Papadimitriou and Seiglitz.
(09/18/02) Here is the first handout for the project (describes what to include in your project proposal).
(09/09/02) Homework 2 (Due Mon, Sept 16): Problem 1 from Ch. 17 of Papadimitriou and Steiglitz; find 1-3 online resources related to the Graph Coloring Problem and/or Asymmetric TSP (mail me the URLs).
(2) A nice Graph Coloring page from SUNY SB with good additional links (thanks to Vivek Shikaripura)
(3) An excellent paper giving practical approaches to graph coloring. (thanks to Devang Jariwala)
(4) Mike Trick's graph coloring page at CMU. (thanks to Rajeev Bhat)
(5) A nice introduction to graph coloring with applications. (thanks to Rajeev Bhat)
(6) A bibliographic resource on graph coloring (thanks to Rajeev Bhat)
(7) This page has some definitions of coloring related terms (thanks to Rajeev Bhat)
(8) Information on the DIMACS challenges (incl. graph coloring) can be found here (thanks to Milos Hrkic)
(9) This is the ftp site for the DIMACS challenge -- lots of benchmarks (thanks to Milos Hrkic)
(10) A paper on graph coloring and cryptography (thanks to Bartek Sieka)
(11) Another paper applying graph theoretic ideas to cryptography (thanks to Bartek Sieka)
(12) This page discusses map coloring and touches on general graph coloring (thanks to Dmitriy Litvak)
(13) A paper on watermarking graph coloring solutions (here a coloring is considered "Intellectual Property"). (thanks to Marco Santambrogio)
(14) A paper including exact algorithms for graph coloring. (thanks to Marco Santambrogio)
(2) DIMACS TSP Challenge (thanks to Vivek Shikaripura)
(3) A General TSP Resource (thanks to Vivek Shikaripura)
(4) A book chapter by David Johnson on ATSP (thanks to Vivek Shikaripura)
(5) Another David Johnson publication; may overlap others. (thanks to Rajeev Bhat)
(6) A nice paper by Glover et. al. on constructive techniques for ATSP (thanks to Huabei Yin)
(7) More experimental evaluation of constructive ATSP heuristics (thanks to Huabei Yin)
(8) Another resource for TSP incl. a generator for ATSP (thanks to Sarat Maruvada)
(9) A "Genetic Algorithm" for ATSP with animations (thanks to Sarat Maruvada)
(10) An "Ant Colony" algorithm for TSP - decide for yourself the merit... (thanks to Sarat Maruvada)
(11) More ants (thanks to Sarat Maruvada)
(12) A bibliographic resource on TSP-related problems and approaches (thanks to Hasan Arslan)
(13) This page includes an interesting practical variant with "time windows" (thanks to Hasan Arslan)
(14) A link to TSPLIB (repository of instances and codes for TSP and related problems (thanks to Ke Zhong and Hasan Arslan)
(15) A link to an Ant Colony paper (thanks to Narayanan Chandrasekaran)
(16) Interesting work on "truncated branch-and-bound" with application to ATSP. (thanks to Narayanan Chandrasekaran)
(17) A web site giving an overview of TSP optimization techniques (thanks to Narayanan Chandrasekaran)
(18) A paper from SODA on lower-bounds for ATSP (thanks to Narayanan Chandrasekaran)
(2) An excellent guide to experimental analysis of algorithms
(3) An interesting survey paper on "Very Large Scale Neighborhood Search Techniques"