Sage Notebooks

I just added the first in a series of Sage Notebooks related to Applied Discrete Structures in the wiki. I'm hoping this series might be developed by students in the coming year.

Comparison of the greedy algorithm with the optimal solutions of the Marriage Problem

In Section 9.5, we introduce graph optimization problems, with an emphasis on the Traveling Salesman Problem and the Network Flow Problem. A the end we mention a few others, including the Minimum Matching Problem, also known as the Marriage Problem. I've just posted a demonstration of this problem, comparing the greedy algorithm with the optimal solution.

This is an example of a cdf file.

Fall 2011 version thanks to Automator and PDFpen

The first ten chapters are now bundled together into one pdf for the first time, including the solutions to odd-numbered exercises. The biggest improvement is that the pages are numbered from 1 to 309.

Thought I'd document the process for future reference. Here are the steps:

Procedure for creating one pdf for 92.321

1. Run Workflow "Build_OnePDF_321" using Automator. This pulls out the files in the right order and saves the combined files into a single pdf.
2. Open the resulting pdf in PDFpen
3. Run an Applescript I call "Number_Pages_KL_odd_even" that numbers the pages alternately on the bottom right and left.
4. Annotate front page with semester-specific information.

That's it. With the software executing the workflows, producing the final pdf takes only a few minutes, most of it in step 4.