Scribd
Upload
3 views2 pages

sp-ex12

The document outlines a special exercise set for CSCI3160, prepared by Yufei Tao, consisting of five problems related to graph theory and algorithms. Problems include finding vertex covers, defining variables and literals in MAX-3SAT, finding Hamiltonian cycles, computing walks in a traveling salesman problem, and designing a polynomial-time algorithm for the Euclidean Traveling Salesman problem. Each problem requires theoretical understanding and application of algorithms taught in class.

Uploaded by

jackychanmachinelearning
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

sp-ex12

The document outlines a special exercise set for CSCI3160, prepared by Yufei Tao, consisting of five problems related to graph theory and algorithms. Problems include finding vertex covers, defining variables and literals in MAX-3SAT, finding Hamiltonian cycles, computing walks in a traveling salesman problem, and designing a polynomial-time algorithm for the Euclidean Traveling Salesman problem. Each problem requires theoretical understanding and application of algorithms taught in class.

Uploaded by

jackychanmachinelearning
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSCI3160: Special Exercise Set 12

Prepared by Yufei Tao

Problem 1. Consider the undirected graph G below.


b
e

a
d
f
c

(a) What is the size of a smallest vertex cover of G?

(b) Is it possible for our vertex cover algorithm (taught in the class) to output a vertex cover of
size 4?

(c) How about size 6?

Problem 2. Define “variable” and “literal” in the same way as we did for the MAX-3SAT problem.
However, re-define a clause as the OR of an arbitrary number of literals subject to the constraint that
all literals need to be defined on distinct variables. Prove: by independently setting each variable to
0 or 1 with 50% probability, we ensure that the clause should evaluate to 1 with probability at least
1/2.

Problem 3. Consider the undirected graph G below.


a

5 4

b 2 e
2 3
4 2 4 3

c 3 d

Use the algorithm taught in the class to find a Hamiltonian cycle that achieves an approximation
ratio of 2.

Problem 4. In Step 2 of our 2-approximate algorithm for our traveling salesman problem, we need
to compute a walk from the MST T computed in Step 1. Explain how to compute the walk in time
proportional to the number of vertices in T .

Problem 5 (Euclidean Traveling Salesman). Let P be a set of n points in 2D space. Define a


cycle as a sequence of n line segments: (s1 , t1 ), (s2 , t2 ), ..., (sn , tn ) where
• si ∈ P and ti ∈ P for each i ∈ [1, n];

• ti = si+1 for all i ∈ [1, n − 1] and s1 = tn ;

• P = {s1 , s2 , ..., sn };

1
• each (si , ti ) is a segment connecting points si and ti .

The length of the cycle is the total length of all the n segments. Let OPTP be the shortest length
of all cycles. Design a poly(n)-time algorithm (i.e., polynomial in n) that finds a cycle with length
at most 2 · OPTP .
Note: for this problem, you can assume that the distance between any two points can be
calculated in polynomial time.

You might also like