Keywords: network flow
Loading...
Displaying 1-4 of 4 results.
Advanced Algorithms, Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic ... More »
Combinatorial Optimization, Fall 2003
| Rating: | |
| Type: | Course Related Materials |
Abstract: Thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems. 18.310 helpful but not required.
Introduction to Algorithms (SMA 5503), Fall 2004
| Rating: | |
| Type: | Course Related Materials |
Abstract: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic ... More »
Introduction to Algorithms (SMA 5503), Fall 2005
| Rating: | |
| Type: | Course Related Materials |
Abstract: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic ... More »
