hw7520_11_1

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

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

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.
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

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern