Albert-Ludwigs-Universit
at, Inst. f
ur Informatik
Prof. Dr. Fabian Kuhn
M. Ahmadi, O. Saukh, A. R. Molla
December 22, 2015
Algorithm Theory, Winter Term 2015/16
Problem Set 8 - Sample Solution
Exercise 1: Rectangular City (4 points)
Given a city map that
Data Structures and Algorithms
FR 6.2 Informatik
Sanders, Telikepalli
WS 03/04
http:/www.mpi- sb.mpg.de/~sanders/courses/algdat03/index.html
Solutions to assignment 3
Exercise 1
Arbitrage is the use of discrepancies in currency exchange rates to transform
Data Structures and Algorithms
FR 6.2 Informatik
Sanders, Telikepalli
WS 03/04
http:/www.mpi- sb.mpg.de/~sanders/courses/algdat03/index.html
Solutions to assignment 4
Exercise 1
A spammer is located at one node q in a undirected communication network G an
Solutions to Problems of Midterm Exam II
1 Given a set Q of points in the plane, we define the convex layers of Q inductively. The first
convex layer of Q consists of those points in Q that are vertices of CH(Q). For i > 1, define
Qi to consist of the poi
CMSC451
Spring 2015
Homework 6
due April 28, 2015
For all algorithms, explain time complexity and prove correctness.
1. Draw out a maximum st flow for the directed graph in the figure below as well as
the corresponding residual graph. You only need to sho
COMP 360 - Fall 2015 - Assignment 1
Due: 6pm Sept 29th.
out
in
1. (5 points) Recall that
every cut
P (A, B), we have val(f ) = f (A) f (A)
P for every flow f and
in
out
where f (A) =
uvE f (uv). Use this fact to show that
uvE f (uv) and f (A) =
uB,vA
uA,v
CSE 101: Design and Analysis of Algorithms
Winter 2016
Homework 4
Due: February 25, 2016
Exercises (strongly recommended, do not turn in)
1. (DPV textbook, Problem 7.11.) Find the optimal solution to the following linear program.
max x + y
2x + y 3
x + 3y
Chapter 34
Exercises - Network Flow
By Sariel Har-Peled, November 30, 2012
Version: 1.02
This chapter include problems that are realted to network flow.
34.1
Network Flow
34.1.1
The good, the bad, and the middle.
[10 Points]
Suppose youre looking at a flo
CS 577 Homework 6
Ellie Holzhausen and Andrew Ma
May 1, 2012
Problem 1
For this question, you are given a directed network G = (V,E) with capacities ce on edges and
a sourse-sink pair (s,t). You are also given the max s-t flow in the graph, f* specifying
TTIC 31010 and CMSC 37000 Algorithms
Winter 2011
Homework set 3
Note: the homework sets are not for submission. They are designed to help you prepare for the
quizzes.
1. In this question we study a variant of the Ford-Fulkerson algorithm. Recall that give