final2 - COS 521 Advanced Algorithm Design Final Due Mon...

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

View Full Document Right Arrow Icon
COS 521: Advanced Algorithm Design Final Due: Mon, May 17 (5 pm) Instructions: There are a total of 6 questions on the Fnal. No collaboration is allowed. You may refer to any reference material; however you should not explictly search for solutions to the questions on the exam. If you do refer to any sources, indicate this on your homework. 1. Given a directed graph G =( V, E ), let f ( G ) be the minimum number of edges of G that need to be deleted so that the remaining graph does not contain any directed cycle. (i) Let D ( G ) be a collection of disjoint directed cycles in G . Show that |D ( G ) |≤ f ( G ). (Note: |D ( G ) | is the number of cycles in D ( G )). (ii) Consider a fractional version of the previous bound. Let D 0 ( G ) be a collection of disjoint directed cycles in G , where each cycle C ∈D 0 ( G ) is associated with a non- negative weight w C . ±urther for every edge e , the sum of weights of all cycles containing e is at most 1. Let W = w C be the sum of weights of cycles in D 0 ( G ). Show that W f ( G ).
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/28/2009 for the course COS 521 taught by Professor Elad during the Spring '09 term at Tsinghua University.

Page1 / 2

final2 - COS 521 Advanced Algorithm Design Final Due Mon...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online