CS231: Topics in Combinatorial Algorithms
Prof. Suri
Homework Assignment 3
Handed Out: Nov. 2
Due: Nov. 9
1. Given a ow network G, there can be multiple st mincuts (cuts of minimum
capacity). Among all these cuts, we want to nd one with the fewest number

CS-230b
Advanced Algorithms and
Applications
Subhash Suri
Computer Science Department
UC Santa Barbara
Fall Quarter 2004.
Subhash Suri
UC Santa Barbara
Shortest Paths
u
v
1
10
2
9
3
s
6
5
7
2
x
y
Find shortest length path from s to v ?
s x u v has lengt

CHAPTER SIX
The Probabilistic Method
"lhe probab,ilisti, m"thod is away of proving the existence of objects. The underlying principle is simple: to prove the existence of an object with certain properties, we
demonstrate a sample space of objects in which

Negative Information in Quantum Mechanics
Qingqing Yuan
June 11, 2006
1
Introduction
Classical information theory has a relatively long history which can be dated back
to 1940s when the notion of classical information was rst introduced by Shannon[8].
The

Minimum Spanning Trees
Given an undirected graph G = (V, E ),
with edge costs cij .
A spanning tree T of G is a cycle-free
subgraph that spans all the nodes.
The cost of T is the sum of the costs of
the edges in T .
MST is the smallest cost spanning t

EXTENSIONS OF THE MAXFLOW PROBLEM.
10A. Circulations with Demands.
Suppose we have multiple sources and sinks, instead of a single
s-t pair. Rather than maximize the total flow (which can be tricky
to agree on due to fairness among different flows),

Assignment and Matching
1. A matching is a pairing of nodescollection
of disjoint edges.
Worker
Job
A
1
B
2
C
3
D
4
2. Bipartite graph. Two node classes,
workers and jobs.
3. An edge (i, j ) means worker i can do job j .
4. If weighted, then c(i, j ) is t

Linear Programming
LP is a general method to solve
optimization problem with linear
objective function and linear constraints.
Diet Problem Example: Feeding an army.
4 menu choices: Fish, Pizza, Hamburger,
Burrito.
Each choice has benets (nutrients) a

CS231: Topics in Combinatorial Algorithms
Prof. Suri
Homework Assignment 4
Handed Out: Nov. 23
Due: Dec. 2
1. Modern Furniture Inc. produces two types of wooden chairs. Manufacturing chair
A requires 2 hours of assembly time and 4 hours of nishing time. C

CS231: Topics in Combinatorial Algorithms
Prof. Suri
Homework Assignment 2
Handed Out: Oct. 12
Due: Oct. 21
1. Consider the following game, dened on a bipartite graph G = (X Y, E ), where
X is a set of n actresses, Y is a set of n actors, and there there

CS231: Topics in Combinatorial Algorithms
Prof. Suri
Homework Assignment 1
Handed Out: Sept 28
Due: Oct 7
1. Let G = (V, E ) be a directed graph whose edges have real-valued costs (possibly
negative). We call G loop-free if it contains no directed loop (c

Entropic Analysis of the Latin Language
Erik Peterson
Department of Computer Science,
UC Santa Barbara,
Santa Barbara, CA 93106
wombatty@cs.ucsb.edu
June 1, 2006
Abstract
In this paper I will explore the entropy of the Latin language with a particular eye

CHANNEL CAPACITY AND SHANNON LIMIT
IN DIGITAL COMMUNICATION SYSTEMS
SANG HYUCK HA
ABSTRACT In this paper, we establish the channel capacity and the Shannon limit in
digital communication systems. For this purpose, we introduce two kinds of channel
models,

A Brief Introduction to Deterministic Annealing
Justin Muncaster
Department of Computer Science
University of California, Santa Barbara
justin.muncaster@gmail.com
Abstract
This paper provides a short description of Deterministic Annealing [1] and its
info