CMSC 244 Report

Matroids and Greedoids in the Minimum Spanning Tree Problem
Presented by : Jerick Mari A. Tancinco
September 21, 2011
Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Outline
Introduction
Jerick Mari A. Tancinco
Matroids and Greedoids in the Minimum Spann

Outline
1 2
Introduction Denitions

Outline
1 2 3
Introduction Denitions MST Problem

Outline
1 2 3 4
Introduction Denitions MST Problem Kruskal's Algorithm

Outline
1 2 3 4 5
Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm

Outline
1 2 3 4 5 6
In 1935, Whitney introduced the notion of matroids in studying planar graphs.
In 1935, Whitney introduced the notion of matroids in studying planar graphs. He dened concepts like independence and rank in graphs and these were found to be connected also to linear independence and dimension in linear algebra.
In 1935, Whitney introduced the notion of matroids in studying planar graphs. He dened concepts like independence and rank in graphs and these were found to be connected also to linear independence and dimension in linear algebra. Eventually, Rado and Edmonds discovered its relation to greedy algorithms and the problems that these algorithms can solve.
In 1935, Whitney introduced the notion of matroids in studying planar graphs. He dened concepts like independence and rank in graphs and these were found to be connected also to linear independence and dimension in linear algebra. Eventually, Rado and Edmonds discovered its relation to greedy algorithms and the problems that these algorithms can solve. Finally, Korte and Lovasz had generalized matroids to greedoids in 1982 by relaxing the denition of matroids.

Set System

Set System
A set system is a pair the ground set
(C; F ),
where C is a nite set called

Set System
A set system is a pair (C; F ), where C is a nite set called the ground set and F is a non-empty collection of subsets of C .

Set System
A set system is a pair (C; F ), where C is a nite set called the ground set and F is a non-empty collection of subsets of C . Set F is called the family of feasible sets.

Matroid

Matroid
A matroid is a set system (C; F ) that satises the following properties:

Matroid
A matroid is a set system (C; F ) that satises the following properties: (hereditary) if X Y and Y P F , then X P F ;

Matroid
A matroid is a set system (C; F ) that satises the following properties: (hereditary) if X Y and Y P F , then X P F ; (exchange) for any X; Y P F such that jX j = jY j + 1, there is an x P X nY such that Y fxg P F .

Greedoid

Greedoid
A greedoid is a set system (C; F ) that satises the following properties:

Greedoid
A greedoid is a set system (C; F ) that satises the following properties: (accessibility) for every non-empty set X P F , there is an x P X such that X n fxg P F ;

Greedoid
A greedoid is a set system (C; F ) that satises the following properties: (accessibility) for every non-empty set X P F , there is an x P X such that X n fxg P F ; (exchange) for any X; Y P F such that jX j = jY j + 1, there is an x P X nY such that Y fxg P F.

Greedoid
A greedoid is a set system (C; F ) that satises the following properties: (accessibility) for every non-empty set X P F , there is an x P X such that X n fxg P F ; (exchange) for any X; Y P F such that jX j = jY j + 1, there is an x P X nY such that Y fxg P F. Remark: (hereditary) => (accessibility), thus, all matroids are greedoid.

The Greedy Algorithm

Let (C; F ) be a set system with an associated function W : F > R.

Let (C; F ) be a set system with an associated function W : F > R. Let X be an empty set.

Let (C; F ) be a set system with an associated function W : F > R. Let X be an empty set. Choose x P C nX such that

1
X
f g is feasible
x

1
X
f g is feasible
x

1 2
X W X
feasible.
f g is feasible ( f g) ( f g) for all

x x W X y
such that X fy g is

1 2
X W X
feasible.

x x W X y
such that X fy g is

1 2
X W X
Let X = X fxg and repeat until augmented.
feasible.

x x W X y
such that X fy g is can no longer be

Minimum Spanning Tree

Consider an undirected connected graph G = (V ; E ) with weight function w : E > R+ .

Consider an undirected connected graph G = (V ; E ) with weight function w : E > R+ . The minimum spanning tree of G is the spanning tree with the minimum sum of edge weights.

Kruskal's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm
Let K
= (E ; F ),
where

Kruskal's Algorithm
Let K
= (E ; F ),
F
where is the edge set of a forest

H
f j
A A
g
G

Kruskal's Algorithm
Let K
= (E ; F ),
F

H
f j
A A
g
G
. Then,
is a matroid

Kruskal's Algorithm
Let K
= (E ; F ),
F

H
f j
A A
g
G
. Then,
is a matroid due to Klappenecker[5].

Kruskal's Algorithm
Let K
= (E ; F ),
F

H
f j
A A
g
G
. Then, K is a matroid due to Klappenecker[5]. The set system K is called the graphic matroid of G.

Kruskal's Algorithm
Let K
= (E ; F ),
F

H
f j
A A
g
G
. Then, K is a matroid due to Klappenecker[5]. The set system K is called the graphic matroid of G. The associated function of W (A) = a2A w(a).
is W
> R
, where

Prims's Algorithm

Prims's Algorithm

Prims's Algorithm

Prims's Algorithm

Prims's Algorithm

Prims's Algorithm

Prim's Algorithm

Prim's Algorithm
Let P
= (E ; F ),
where

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
is the edge set of a rooted tree
g
G

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
g
G
Then, P is not a matroid

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
g
G
Then, P is not a matroid but it is a greedoid

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
g
G
Then, P is not a matroid but it is a greedoid due to Klappencker [4].

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
g
G
Then, P is not a matroid but it is a greedoid due to Klappencker [4]. The set system P is called the branching greedoid of G.

Prim's Algorithm
Let P
F
= (E ; F ), =
where
H
f j
B B
g
G
Then, P is not a matroid but it is a greedoid due to Klappencker [4]. The set system P is called the branching greedoid of G. The associated function of P is W W (B ) = b2B w(b).
> R
, where

Conclusion

Conclusion
Greedoids can cover more greedy algorithms than matroids in solving optimization problems.

Conclusion
Greedoids can cover more greedy algorithms than matroids in solving optimization problems. There is an associated greedoid for every optimal greedy solution.

References

References
1 Boyd, E. A. (1988). A combinatorial abstraction of the shortest path problem and its relationship to greedoids. http://www.caam.rice.edu/caam/trs/88/TR88-07.pdf.

References
1 Boyd, E. A. (1988). A combinatorial abstraction of the shortest path problem and its relationship to greedoids. http://www.caam.rice.edu/caam/trs/88/TR88-07.pdf. 2 Greedoid. (n.d.). In Wikipedia. Retrieved September 20 2011, from http://en.wikipedia.org/wiki/Greedoid.

References
1 Boyd, E. A. (1988). A combinatorial abstraction of the shortest path problem and its relationship to greedoids. http://www.caam.rice.edu/caam/trs/88/TR88-07.pdf. 2 Greedoid. (n.d.). In Wikipedia. Retrieved September 20 2011, from http://en.wikipedia.org/wiki/Greedoid. 3 Johnson, W. (2009). Matroids. http://www.math. washington.edu/ morrow/3360 9=papers=W ill:pdf:

References
1 Boyd, E. A. (1988). A combinatorial abstraction of the shortest path problem and its relationship to greedoids. http://www.caam.rice.edu/caam/trs/88/TR88-07.pdf. 2 Greedoid. (n.d.). In Wikipedia. Retrieved September 20 2011, from http://en.wikipedia.org/wiki/Greedoid. 3 Johnson, W. (2009). Matroids. http://www.math. washington.edu/ morrow/3360 9=papers=W ill:pdf: 4 Klappenecker, A. (2009). Accessible set systems. http://faculty.cs.tamu.edu/klappi/cpsc411s09/cpsc411set4.ppt.

References
5 Klappenecker, A. (2009). Greedy algorithms for matroids. http://faculty.cs.tamu.edu/klappi/cpsc411-f09/cpsc411set3.ppt.

References
5 Klappenecker, A. (2009). Greedy algorithms for matroids. http://faculty.cs.tamu.edu/klappi/cpsc411-f09/cpsc411set3.ppt. 6 Tedford, S. J. (2007). Connectivity of the lifts of a greedoid. http://www.combinatorics.org/Volume1 4=P DF =v 14i1n9:pdf:
Thank you!

CMSC 244 Report

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CMSC 244 Report

Uploaded by

Copyright:

Available Formats

Matroids and Greedoids in the Minimum Spanning Tree Problem

Presented by : Jerick Mari A. Tancinco

September 21, 2011

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

In 1935, Whitney introduced the notion of matroids in studying planar graphs.

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

A set system is a pair the ground set

where C is a nite set called

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

A matroid is a set system (C; F ) that satises the following properties:

Jerick Mari A. Tancinco

Matroids and Greedoids in the Minimum Spann

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

where C is a nite set called

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

A matroid is a set system (C; F ) that satises the following properties:

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

A greedoid is a set system (C; F ) that satises the following properties:

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion

Introduction Denitions MST Problem Kruskal's Algorithm Prim's Algorithm Conclusion