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

Info icon This 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 fixed 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, finding the minimum cost Steiner tree is NP-Complete. (a) Give a polynomial time algorithm to find the minimum cost Steiner tree in the case that | S | = 3. (b) Give a 2-approximation for the problem of finding a minimum cost Steiner tree (for any set S ).
Image of page 1

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

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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern