final2f03 - asymptotic upper bounds on their time...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Final 2 : COT5405 Fall ’03 Time: 120 minutes Open Book; Open Notes 1. (25 pts) Prove or disprove (Without using Sterling’s formulae): 2. (15 pts) Suppose that is the minimum-weight edge of an undirected weighted graph and all other edges have strictly larger weights. Prove that every minimum spanning tree of includes the edge . (Note: Any reference to minimum spanning tree algorithms such as Kruskal’s or Prim’s will get you no points.) 3. (15+15 pts) Consider a connected, unweighted, undirected graph . The “Height” of a rooted spanning tree is the maximum distance from root to any leaf (over all leaves) of that spanning tree. For each of the two questions below either give an efficient (polynomial time in vertices/edges) algorithm or formally argue via reduction why one might not exist. a. Is there a rooted spanning tree of “height” at most . b. Is there a rooted spanning tree of “height” at least . If you do provide algorithms, prove that they give the correct answer. Also, analyze and give
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: asymptotic upper bounds on their time complexity. If not, show the polynomial reduction from a NP-hard problem. 4. (5+25 pts) The Set-Partition Problem is defined as follows. As input we are given a finite set of positive integers. The question is whether there is a subset such that the sum of the elements in equals the sum of the elements in . The Ruler-Folding Problem is defined as follows. As input we are given a sequence of hinged ruler segments with integer lengths , and a pocket size . The question is whether the ruler can be folded (that is each hinge folded to either or degrees) to fit into the pocket (See Figure below). k 5 4 3 2 1 l l l l l a. Prove that the Set-Partition Problem and the Ruler-Folding Problem are in NP. b. Prove that the Ruler-Folding Problem is NP-Complete assuming that the Set-Partition Problem is NP-Complete. 1...
View Full Document

This note was uploaded on 05/27/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.

Ask a homework question - tutors are online