Skip to main content
This site is currently under development.
Lecture Notes
: Lecture notes and course materials
Editions
: Past and current editions of the course
Problems
: Problem sets and exercises
Preface
Overview
1. Greedy
Overview
1. Storing Files on a Tape
2. A Scheduling Problem
3. Stable Matchings
2. Dynamic Programming
Overview
1. Longest Increasing Subsequence
2. Subset Sum
3. Set Cover
4. Optimal BSTs
5. Maximum Independent Set on Trees
3. Flows and Cuts
Overview
4. Hardness
Overview
5. Randomized Algorithms
Overview
6. Fixed-Parameter Tractability
Overview
7. Approximation Algorithms
Overview
8. Hardness of Approximation
Overview
9. Approximation and Randomization
Overview
10. Randomized FPT
Overview
11. Parameterized Approximation
Overview
12. Heuristics
Overview
Advanced Algorithms
Materials
My Scores
Search
K
Cancel
On this page
Flows and Cuts
5. Maximum Independent Set on Trees
Overview
Tape
Files
Your Cost:
—
Optimal Cost:
—
Drag all files onto the tape to arrange them.
Reset
Check Solution
New Problem