hw2 - CS 473: Algorithms, Fall 2010 HW 2 (due Tuesday,...

This preview shows pages 1–2. Sign up to view the full content.

CS 473: Algorithms, Fall 2010 HW 2 (due Tuesday, September 14th) This homework contains four problems. Read the instructions for submitting homework on the course webpage . In particular, make sure that you write the solutions for the problems on separate sheets of paper. Write your name and netid on each sheet. Collaboration Policy: For this home work, Problems 2-4 can be worked in groups of up to 3 students each. Problem 1 should be answered in Compass as part of the assessment HW2-Online and should be done individually. 1. (10 pts) Short questions to be answered on compass individually. 2. (30 pts) Suppose you are given a directed graph G = ( V,E ) with non-negative edge lengths; ( e ) is the length of e E . You are interested in the shortest path distance between two given locations/nodes s and t . It has been noticed that the existing shortest path distance between s and t in G is not satisfactory and there is a proposal to add exactly one edge to the graph to improve the situation. The candidate edges from which one has to be chosen

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Page1 / 2

hw2 - CS 473: Algorithms, Fall 2010 HW 2 (due Tuesday,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online