{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw_3 - CS 573 Algorithms Fall 2009 Homework 3 due...

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

CS 573: Algorithms, Fall 2009 Homework 3, due Wednesday, October 28, 23:59:59, 2009 Version 1.0 Name: Net ID: Alias: # Score Grader 1. 2. 3. 4. Total Neatly print your name(s), NetID(s), and the alias(es) you used for Homework 0 in the boxes above. Staple this sheet to the top of your homework. If you are on campus, submit the homework by submitting it in SC 3306 (or sliding it under the door). At other times you seemed to me either pitiable or contemptible, eunuchs, artificially confined to an eternal childhood, childlike and childish in your cool, tightly fenced, neatly tidied playground and kindergarten, where every nose is carefully wiped and every troublesome emotion is soothed, every dangerous thought repressed, where everyone plays nice, safe, bloodless games for a lifetime and every jagged stirring of life, every strong feeling, every genuine passion, every rapture is promptly checked, deflected and neutralized by meditation therapy. – The Glass Bead Game, Hermann Hesse Required Problems 1. Prove infeasibility. [25 Points] You are trying to solve a circulation problem, but it is not feasible. The problem has demands, but no capacity limits on the edges. More formally, there is a graph G = ( V, E ), and demands d v for each node v (satisfying v

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.

{[ snackBarMessage ]}

### Page1 / 3

hw_3 - CS 573 Algorithms Fall 2009 Homework 3 due...

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

View Full Document
Ask a homework question - tutors are online