This preview shows page 1. Sign up to view the full content.
Unformatted text preview: weighted graph G , the length of the shortest Hamiltonian cycle in G . Describe and analyze a polynomial-time algorithm that computes, given an arbitrary weighted graph G , the shortest Hamiltonian cycle in G , using this magic black box as a subroutine. 3. Prove that the following problems are NP-complete. (a) Given an undirected graph G , does G have a spanning tree in which every node has degree at most 17? (b) Given an undirected graph G , does G have a spanning tree with at most 42 leaves? 1...
View Full Document
This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08