Illinois Institute of Technology
Department of Computer Science
Homework Assignment 0
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Rules for Homework
On this and all future homework as
Illinois Institute of Technology
Department of Computer Science
Homework 2 Solutions
CS 535 Introduction to Algorithms
Fall Semester, 2016
1. Problem 1
Solution:
For convenience, we describe a job as
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 11
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. (PhD problem) Show that th
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 3
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
1. Denote Di as the heap after i-th oper
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 7
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, October 13, 2016
Remember the Honesty
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 11
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, November 10, 2016
Remember the Honest
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 5
(Corrected)
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, September 29, 2016
Remembe
Vivek Vijaykumar Bajpai (A20361204)
HW0
26 August 2015
Q1. Does the corrupted code still work (that is, correctly find the ith smallest element) always,
some-times, or never? Explain.
Ans. Since we ar
Lecture 5: Max-Flow And Min-Cut:
Extensions & Applications
Fall 2017
Prof. Peng-Jun Wan
1
Outline
Transshipment
Max/Min-flow with demands
Weighted vertex cover and stable set in bipartite graphs
Surve
Lectuere 1: Shortest Path
Fall 2017
Prof. Peng-Jun Wan
1
Walk, Path, Circuits
Walk: a traversal from vertex to vertex along edges.
Trail: a walk without repeated edges
Path: a walk without repeated in
Lecture 2: Bipartite Matching
Fall 2017
Prof. Peng-Jun Wan
1
Outline
Problem description
Alternating and augmenting paths
Residue digraph
Maximum-size bipartite matching algorithm
Stable set, vertex c
Lecture 6: Min-Cost Flow, Circulation
Fall 2017
Prof. Peng-Jun Wan
1
Outline
Problem Description
Residue Graph
Min-Cost Max-Flow
Min-Cost Circulation
Mutual Reductions
2
1. Problem Description
Flow Ne
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 4
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
1. By Case 1 of the Access Lemma, we kno
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 7
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. When j = 1, A3 (1) > tower(
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 12
CS 535 Introduction to Algorithms
Fall Semester, 2016
1. The gadget in the textbook has a nice prope
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 1
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. Let G(i, j) be the maximal
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 1
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, September 1, 2016
Remember the Honesty
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 2
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, September 8, 2016
Remember the Honesty
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 0
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. Integer 1 will be returned
Illinois Institute of Technology
Department of Computer Science
Homework Assignment 3
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Due: Thursday, September 15, 2016
Remember the Honest
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 10
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. If the next character a ma
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 8
CS 535 Design and Analysis of Algorithms
Fall Semester, 2016
Solution:
1. For rational capacities, we
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 5
Corrected
CS 535 Design and Analysis of Algorithms
Fall Semester, 2015
Solution:
1. According to the
Illinois Institute of Technology
Department of Computer Science
Solutions to Homework Assignment 6
CS 535 Introduction to Algorithms
Fall Semester, 2016
Solution:
1. If m log n, we can always use bina
Lecture 4: Max-Flow And Min-Cut:
Fundamental Algorithms
Fall 2017
Prof. Peng-Jun Wan
1
Soviet Rail Network, 1955
Reference: On the history of the transportation and maximum flow problems.
Alexander Sc