hw7520_11_1 - (b Generalize the problem the algorithm and...

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

View Full Document Right Arrow Icon
CS 7250, Approximation Algorithms Homework 1 Thu, Jan 20, 2011 Due Thu, Jan 27, 2011 Problem 1: Maxcut, Greedy Approximation Algorithm Consider the cardinality maxcut problem, as defined in Vazirani Exercise 2.1 (page 22), and the greedy algorithm given also in Vazirani Exercise 2.1 (Algorithm 2.13, page 22.) In class (lecture 1-18-11) we showed that Algorithm 2.13 is a factor 1/2 approximation algorithm. (a) Give a class of graphs for which the 1/2 approximation factor is tight.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (b) Generalize the problem, the algorithm and its analysis to weighted graphs. Problem 2: Maxcut, Local Search Approximation Algorithm Vazirani Exercise 2.2 (page 23). Problem 3: Vertex Coloring Vazirani Problem 2.16 (pages 22 and 23). Note: : Widgerson’s original paper on this problem is reference 265 (page 372) in Vazirani’s book....
View Full Document

This note was uploaded on 10/23/2011 for the course CS 7520 taught by Professor Staff during the Spring '08 term at Georgia Tech.

Ask a homework question - tutors are online