Textbooks The Design of Approximation Algorithms
Book Cover for The Design of Approximation Algorithms

The Design of Approximation Algorithms

David P. Williamson, David B. Shmoys 1st Edition ISBN #9780521195270 131 Questions
0 Students Work From this Textbook

Get access to all of the answers and step-by-step video explanations to this book and 5,000+ more. Try Numerade free.

Chapters

1

An Introduction to Approximation Algorithms

0 sections
6 questions
2

Greedy Algorithms and Local Search

0 sections
16 questions
3

Rounding Data and Dynamic Programming

0 sections
9 questions
4

Deterministic Rounding of Linear Programs

0 sections
7 questions
5

Random Sampling and Randomized Rounding of Linear Programs

0 sections
14 questions
6

Randomized Rounding of Semidefinite Programs

0 sections
8 questions
7

The Primal-Dual Method

0 sections
10 questions
8

Cuts and Metrics

0 sections
12 questions
9

Further Uses of Greedy and Local Search Algorithms

0 sections
5 questions
10

Further Uses of Rounding Data and Dynamic Programming

0 sections
5 questions
11

Further Uses of Deterministic Rounding of Linear Programs

0 sections
6 questions
12

Further Uses of Random Sampling and Randomized Rounding of Linear Programs

0 sections
6 questions
13

Further Uses of Randomized Rounding of Semidefinite Programs

0 sections
3 questions
14

Further Uses of the Primal-Dual Method

0 sections
5 questions
15

Further Uses of Cuts and Metrics

0 sections
9 questions
16

Techniques in Proving the Hardness of Approximation

0 sections
0 questions
17

Open Problems

0 sections
10 questions
Numerade

Get step-by-step video solution
from top educators

Continue with Clever
or



By creating an account, you agree to the Terms of Service and Privacy Policy
Already have an account? Log In

A free answer
just for you

Watch the video solution with this free unlock.

Numerade

Log in to watch this video
...and 100,000,000 more!


EMAIL

PASSWORD

OR
Continue with Clever