HW1 SOLUTION
1. Chapter 2
Problem 2: Suppose you have algorithms with the six running times listed
below.(Assume these are the exact number of operations performed as a function
of the input size n.)
c 2005 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH.
Vol. 19, No. 1, pp. 122134
TIGHTER BOUNDS FOR GRAPH STEINER TREE
APPROXIMATION
GABRIEL ROBINS AND ALEXANDER ZELIKOVSKY
Abst
CS 598CSC: Approximation Algorithms
Instructor: Chandra Chekuri
Lecture date: January 30, 2009
Scribe: Kyle Fox
In this lecture we explore the Knapsack problem. This problem provides a good basis for
Comp 260: Advanced Algorithms
Tufts University, Spring 2009
Prof. Lenore Cowen
Scribe: Jordan Crouser
Lecture 4: The Knapsack Problem
1
The Knapsack Problem Dened
We are given a set
S = a1 , a2 , . .
Massachusetts Institute of Technology
18.434: Seminar in Theoretical Computer Science
Lecturer: Adriana Lopez
March 7, 2006
Steiner Trees and Forests
1
Steiner Tree
Problem Given an undirected graph G
Massachusetts Institute of Technology 18.434: Seminar in Theoretical Computer Science
Lecturer: Lele Yu February 16, 2006
Lecture notes on Shortest Superstring Problem
So far we have studied the set c
,5
CMPUT 675: Approximation Algorithms
Fall 2011
Lecture 4, 5 (Sep 20, Sep 22, 2011 ): Set Cover, LP Duality, 0-1 Kanpsack
Lecturer: Mohammad R. Salavatipour
Scribe: Amritpal Saini
This week we see tw
15-451 S10: Quiz 2
Name:
Andrew id:
Closed book. One sheet of notes allowed. You should have four pages. You have 30 minutes
budget your time carefully.
When you are not sure what is meant by a quest
CS261 - Optimization Paradigms
Lecture Notes for 2009-2010 Academic Year
Serge Plotkin
January 2010
1
Contents
1 Steiner Tree Approximation Algorithm
5
2 The Traveling Salesman Problem
9
2.1
9
2.1.1
D
Ecient approximation algorithms
for the Subset-Sums Equality problem
Cristina Bazgan
Miklos Santha
Universit Paris-Sud, LRI, bt 490
e
a
F91405 Orsay, France,
[email protected]
CNRS, URA 410,
Universit Par