This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 473: Fundamental Algorithms, Spring 2012 Homework 2 (due Tuesday, 23:55:00, February 7, 2012) This homework contains three problems. Read the instructions for submitting the home work on the course webpage . Read the course policies before starting the homework. Collaboration Policy: For this homework, Problems 1–3 can be worked in groups of up to three students. Each student individually have to also do quiz 2 online. Submission guidelines: See previous homework. 1. ( 30 pts. ) Reductions. No proofs required for the problems in this question but a brief justification/explanation would help you get some partical credit if your algorithm turns out to be incorrect. You should give polynomial time algorithms for the problems. The faster the better. Grossly inefficient algorithms will get zero credit. (A) ( 10 pts. ) Failing edges. Let G = ( V,E ) be a directed graph. Each edge e ∈ E has a probability p ( e ) ∈ [0 , 1] of failing. The edges fail independently of each other. Given1] of failing....
View
Full Document
 Spring '08
 Chekuri,C
 Algorithms, Graph Theory, 10 pts, 35 pts, 30 pts, length/cost ce

Click to edit the document details