hw9 - Introduction to Algorithms CS 482 Spring 2006 Problem...

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

View Full Document Right Arrow Icon
Introduction to Algorithms Problem Set 9 CS 482 Spring 2006 Due: Friday, April 21 Please hand in each problem on separate sheets with your name and netID on each. If a problem requires multiple sheets, please staple the sheets for that problem together Reading: Chapters 10.1, 10.2, 11.1 - 11.4, 11.8. Question 1 Show that for any Fxed constant k 2, determining whether or not an undirected graph G has a spanning tree T with exactly k leaves is NP-Complete. Question 2 Suppose we have an undirected graph G =( V,E ) with edges costs c e 0 for each edge e E , and a set of nodes S V . Done. Recall that a Steiner tree for S is a tree T in G that spans all nodes in S . As you’ve seen in class, in general, Fnding the minimum cost Steiner tree is NP-Complete. (a) Give a polynomial time algorithm to Fnd the minimum cost Steiner tree in the case that | S | =3 . (b) Give a 2-approximation for the problem of Fnding a minimum cost Steiner tree (for any set S ).
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 homework help was uploaded on 10/17/2007 for the course COM S 482 taught by Professor Wexler during the Spring '06 term at Cornell University (Engineering School).

Page1 / 2

hw9 - Introduction to Algorithms CS 482 Spring 2006 Problem...

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