Difference between revisions of "CSE591 Randomized/Approximation Algorithms"

Revision as of 00:44, 3 November 2008

<embed src="http://www.archive.org/flow/FlowPlayerLight.swf?config=%7Bembedded%3Atrue%2CshowFullScreenButton%3Atrue%2CshowMuteVolumeButton%3Atrue%2CshowMenu%3Atrue%2CautoBuffering%3Atrue%2CautoPlay%3Atrue%2CinitialScale%3A%27fit%27%2CmenuItems%3A%5Bfalse%2Cfalse%2Cfalse%2Cfalse%2Ctrue%2Ctrue%2Cfalse%5D%2CusePlayOverlay%3Afalse%2CshowPlayListButtons%3Atrue%2CplayList%3A%5B%7Burl%3A%27RonaldLG1988%2FRonaldLG1988%2Eflv%27%7D%5D%2CcontrolBarGloss%3A%27high%27%2CshowVolumeSlider%3Atrue%2CbaseURL%3A%27http%3A%2F%2Fwww%2Earchive%2Eorg%2Fdownload%2F%27%2Cloop%3Afalse%2CcontrolBarBackgroundColor%3A%270x000000%27%7D" width="320" height="268" scale="noscale" bgcolor="111111" type="application/x-shockwave-flash" allowFullScreen="true" allowScriptAccess="always" allowNetworking="all" pluginspage="http://www.macromedia.com/go/getflashplayer"></embed>

Homework 3

• Aldous and Fill. Reversible Markov Chains and Random Walks on Graphs, Online Book.

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

Homework 2

Problem 1

• Chernoff bound

Problem 2

• Union bound, (Boole's inequality)

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: