Difference between revisions of "CSE591 Randomized/Approximation Algorithms"

Revision as of 00:14, 17 October 2008

Problem 1

(?) Peter G. Doyle J. Laurie Snell. Random walks and electric networks. Version 35 January 2000 Copyright (C) 1999, 2000 Peter G. Doyle and J. Laurie Snell Derived from work(s) Copyright (C) 1984 The Mathematical Association of America

Problem 4

A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensk. The electrical resistance of a graph captures its commute and cover times. STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing. ACM. February 1989

Problem 1

Problem 2

Term: FALL 08 Name: CSE 591 Section: 79117 Instructor: KONJEVOD Course ID: 79117 Location: TEMPE CAMPUS

REQUIRED RANDOMIZED ALGORITHMS Look Inside This Book Author: MOTWANI

ISBN: 9780521474658

Used: $51.75    New: $69.00

Quantity:

REQUIRED APPROXIMATION ALGORITHMS Look Inside This Book Author: VAZIRANI

ISBN: 9783540653677

Used: $37.50    New: $50.00

Quantity:

@@ Line 1: / Line 1: @@
 === Homework 3 ===
 *Aldous and Fill. [http://stat-www.berkeley.edu/users/aldous/RWG/book.html Reversible Markov Chains and Random Walks on Graphs], Online Book.
+'''Problem 1'''
+*(?) Peter G. Doyle J. Laurie Snell. [http://www.ee.technion.ac.il/~adam/FUN/RWEN.pdf Random walks and electric networks]. Version 35 January 2000 Copyright (C) 1999, 2000 Peter G. Doyle and J. Laurie Snell Derived from work(s) Copyright (C) 1984 The Mathematical Association of America
 '''Problem 4'''
 * A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensk. [http://delivery.acm.org.ezproxy1.lib.asu.edu/10.1145/80000/73062/p574-chandra.pdf?key1=73062&key2=6517224221&coll=portal&dl=ACM&CFID=10949569&CFTOKEN=52685087 The electrical resistance of a graph captures its commute and cover times]. STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing. ACM. February 1989
 === Homework 2 ===