CS 684 Spring 2012
Graph Algorithms
February 20, 2012: Assignment 1 is released.
January 30, 2012: Reading list is updated.
This is an advanced course in the design and analysis of efficient algorithms. The emphasis is on algorithms for standard graph problems, such as minimum spanning trees, shortest paths, network flow, and maximum matching. We will also study advanced data structures, which are crucial for the more advanced topics. Randomized algorithms will also be discussed.
Prerequisites:
CS 583. Please contact with the instructor if you are not sure.
Course Materials (Tentative):
Lecture
|
Date
|
Topic
|
Scope
|
Assignments
|
Note
|
1
|
01/23/2012
|
Graphs
|
Background |
||
2
|
01/30/2012 |
Graph Traversal
|
Math Background (from Spring 10's class) |
||
3
|
02/06/2012
|
Minimum
Spanning Tree
|
|||
4
|
02/13/2012
|
Shortest
Paths
|
|||
5
|
02/20/2012
|
Network
Flows
|
|||
6
|
02/27/2012
|
Network
Flow Applications
Bipartite Matching |
|||
7
|
03/05/2012
|
Linear Programming
|
Notify the intructor the topic you choose for your paper and presentation |
||
03/12/2012
|
Spring
Break
|
||||
8
|
03/19/2012
|
Approximation Algorithms Nan Li's talk (45 minutes) |
Assignment
1 due
|
||
9
|
03/26/2012
|
Class cancelled
|
|
||
10
|
04/02/2012
|
Approximation
Algorithms
|
|
||
11
|
04/09/2012
|
Multiway
Cut and k-Cut
|
|||
12
|
04/16/2012
|
Complex
Networks
|
Complex Networks: Introduction Mansour Abdulaziz, ``A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs''. Tyler Hollingsworth, ``Packet Routing with Arbitrary End-to-End Delay Requirements''. Vidmas Kondratas, ``The Robot Localization Problem''. |
||
13
|
04/23/2012
|
Maryam Bandari, ``Energy-(Harvesting)-Aware Routing Problems in WSNs''. Rohan Khade, ``Sybil Defenses via Social Media''. Songrun Liu, ``Shortest Paths without a Map''. Michael Connor, ``Graph Properties: Centrality, Density, Connectivity, etc.'' |
|||
14
|
04/30/2012
|
Shiva Ghaemi, ``Partitioning Graphs to Speedup Dijkstra's Algorithm''. Steve Donnelly, ``On the K-Shortest Paths Problem''. Yuan Li, ``Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems''. Venkatesh Jagannathan, ``Arbitrage(Currency) Graph Algorithms''. |
|||
15
|
05/14/2012, 11:59pm
|
Report due date
|
Tentative Grading:
Assignments (45%)
Survey/research (40%)
Presentation (15%)
Reading List (Being Updated):
Combinatorial Optimization, Theory and Algorithms (KV) by Bernhard Korte and Jen Vygen, Springer, 4th Edition (2008). (GMU's libraries have online versions of this book.)
Networks, Crowds, and Markets: Reasoning about a Highly Connected World by David Easley and Jon Kleinberg, Cambridge University Press, (2010).
Introduction to Graph Theory by Douglas B. West, 2nd Edition (2000). The 3rd Edition is coming. You may want to wait for the 3rd Edition.
Combinatorial Optimization: Algorithms and Complexity by C. H. Papadimitriou and K. Steiglitz, Englewood Cliffs, Prentice Hall, c1982, Reprinted by Dover Books, (1998).
Algorithm Design (KT) by Jon Kleinberg and Eva Tardos, Pearson Education, Inc. (2006). (You can find the sample chapters on the webpage.)
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, The McGraw-Hill Companies, 2nd Edition (2001).
The mathematics of Algorithm Design and Authoritative Sources in a Hyperlinked Environment by Jon Kleinberg, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, (1998)
S. Koenig, J. S. B. Mitchell, A. Mudgal, and C. Tovey, ``A Near-Tight Approximation Algorithm for the Robot Localization Problem'', SIAM Journal on Computing, Vol. 39, No. 2, pp. 461-490, 2009.
B. Awerbuch, F. T. Leighton, ``A simple Local-Control Approximation Algorithm for Multicommodity Flow'', Proceedings of the 34th IEEE Annual Foundations of Computer Science (FOCS), pages 459-468, 1993.
S. Arora, ``Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems'', Journal of the ACM (JACM), Volume 45, Issue 5, pages 753-783, 1998.
D. S. Hochbaum, ``Approximating Covering and Packing Problems: Set cover, Vertex cover, Independent set, and Related problems'', pages 94-143, in Approximation Algorithms for NP-hard Problems, 1997.
P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, "Approximating Extent Measures of Points", Journal of the ACM (JACM), Vol. 51, No. 4, pages 606-635, 2004
J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts. Online Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. Journal of the Association for Computing Machinery 44(3):486-504, May 1997.
M. Andrews and L. Zhang. Packet Routing with Arbitrary End-to-End Delay Requirements, STOC 99.
E. D. Demaine, S. P. Fekete, and S. Gal. Online Searching with Turn Cost, 2004.
R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the Plane, Information and Computation, 106:234252, 1993.
C. H. Papadimitriou and M. Yannakakis, Shortest Paths without a Map, Theoretical Computer Science, 84:127 150, 1991.
Anders Dessmark and Andrzej Pelc, Optimal Graph Exploration without Good Maps, Theoretical Computer Science, Volume 326 , Issue 1-3, October 2004.
Avrim Blum and Prasad Chalasani, An On-Line Algorithm for Improving Performance in Navigation, SIAM Journal on Computing, 2000.
H. B. McMahan and A. Blum, Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary, COLT, 2004
Valerie King, A Simple Minimum Spanning Tree Verification Algorithm. Algorithmica, 1997.
Sybil Defenses via Social Networks: A Tutorial and Survey, Haifeng Yu
Online and Incremental Algorithms for Facility Location, Dimitris Fotakis
Dynamic Networks: Models and Algorithms, Fabian Kuhn Rotem Oshman
ACM Computing Surveys, ACM Computing Surveys
ACM SIGACT News, ACM SIGACT News
M. Chrobak, 2005 An Offline Perspective, ACM SIGACT News, March 2006.
The integrity of the University community is affected by the individual choices made by each of us. GMU has an Honor Code with clear guidelines regarding academic integrity. Three fundamental and rather simple principles to follow at all times are that: (1) all work submitted be your own; (2) when using the work or ideas of others, including fellow students, give full credit through accurate citations; and (3) if you are uncertain about the ground rules on a particular assignment, ask for clarification. No grade is important enough to justify academic misconduct.
Plagiarism means using the exact words, opinions, or factual information from another person without giving the person credit. Writers give credit through accepted documentation styles, such as parenthetical citation, footnotes, or endnotes. Paraphrased material must also be cited, using MLA or APA format. A simple listing of books or articles is not sufficient. Plagiarism is the equivalent of intellectual robbery and cannot be tolerated in the academic setting. If you have any doubts about what constitutes plagiarism, please see me.
Disability Statement:
If you have a learning or physical difference that may affect your academic work, you will need to furnish appropriate documentation to the Disability Resource Center. If you qualify for accommodation, the DRC staff will give you a form detailing appropriate accommodations for your instructor.
In addition to providing your professors with the appropriate form, please take the initiative to discuss accommodation with them at the beginning of the semester and as needed during the term. Because of the range of learning differences, faculty members need to learn from you the most effective ways to assist you. If you have contacted the Disability Resource Center and are waiting to hear from a counselor, please tell me.