Scribd
Upload
28 views

Assignment 2

The document provides an assignment on approximation algorithms that includes problems on set cover, absolute k-centre, k-supplier, Steiner tree, senders and receivers, and knapsack. It lists six problems and asks for approximation algorithms with performance guarantees for set cover, absolute k-centre, k-supplier, and Steiner tree, as well as approximation algorithms for k-supplier and knapsack.

Uploaded by

ashish3586
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
28 views

Assignment 2

The document provides an assignment on approximation algorithms that includes problems on set cover, absolute k-centre, k-supplier, Steiner tree, senders and receivers, and knapsack. It lists six problems and asks for approximation algorithms with performance guarantees for set cover, absolute k-centre, k-supplier, and Steiner tree, as well as approximation algorithms for k-supplier and knapsack.

Uploaded by

ashish3586
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Comp692: Approximation Algorithms

Due: Monday October 16th

Assignment 2
1. Set Cover. Take a set cover problem with n elements. Give an approximation + 1, where k is the cardinality of the algorithm with performance guarantee ln n k optimal solution. 2. Absolute k -Centre. Consider the k -centre problem with metric costs. As well as being able to open a centre at any vertex, suppose we may now open a centre at any point along any edge. Let e = (u, v ) with distance de , and let a point y on e be an fraction of the way along the edge from u to v . Then we dene d(y, u) = de and d(y, v ) = (1 )de . Give a 2-approximation algorithm for this the absolute k -centre problem. 3. k -Supplier Problem. Take a graph G = (V, E ) where V = S C where S is a set of suppliers and C is a set of customers. Assume that the edge lengths satisfy the triangle inequality. The k -supplier problem is to choose a set M S of k supply vertices to minimise the maximum distance of any customer vertex to a vertex in M . (a) Prove that there is no 3 unless P = N P . approximation algorithm for this problem

(b) Find a factor 3-approximation algorithm for this problem. 4. Steiner Tree Problem. Given a graph G with edge costs and set T V of terminal vertices, the steiner tree problem is nd a minimum cost tree in G containing every vertex in T (vertices in V T may or may not be used in T ). (a) Give a 2-approximation algorithm if the edge costs satisfy the triangle inequality. (b) Give a 2-approximation algorithm for general edge costs (the graph also need not be complete). 5. Senders and Receivers. Vazirani: Question 3.2, page 33. 6. Knapsack Problem. Give a simple 2-approximation algorithm for the Knapsack problem. 1

You might also like