# Algorithm – Algorithm and Data Structures

Algorithm – 这是一个NP算法的题目，属于难度级别很高的题目

### ITCS 6114&8114 Algorithm and Data Structures

``````
``````

35.1 – 4 (50 points) Give an efficient greedy algorithm that finds an optimal vertex cover for a tree in linear time.

35 .2- 2 (50 points)

Show how in polynomial time we can transform one instance of the traveling salesman problem into another instance whose cost function satisfies the triangle inequality. The two instances must have the same set of optimal tours. Explain why such a polynomial – time transformation does not contradict. Theorem 35.3, assuming that P NP.

``````FALL 2018
``````

# Algorithm – Algorithm and Data Structures

Algorithm – 这是一个NP算法的题目，属于难度级别很高的题目

### ITCS 6114&8114 Algorithm and Data Structures

``````
``````

35.1 – 4 (50 points) Give an efficient greedy algorithm that finds an optimal vertex cover for a tree in linear time.

35 .2- 2 (50 points)

Show how in polynomial time we can transform one instance of the traveling salesman problem into another instance whose cost function satisfies the triangle inequality. The two instances must have the same set of optimal tours. Explain why such a polynomial – time transformation does not contradict. Theorem 35.3, assuming that P NP.

``````FALL 2018
``````

# Algorithm – Algorithm and Data Structures

Algorithm – 这是一个NP算法的题目，属于难度级别很高的题目

### ITCS 6114&8114 Algorithm and Data Structures

``````
``````

35.1 – 4 (50 points) Give an efficient greedy algorithm that finds an optimal vertex cover for a tree in linear time.

35 .2- 2 (50 points)

Show how in polynomial time we can transform one instance of the traveling salesman problem into another instance whose cost function satisfies the triangle inequality. The two instances must have the same set of optimal tours. Explain why such a polynomial – time transformation does not contradict. Theorem 35.3, assuming that P NP.

``````FALL 2018
``````