Browsing Mathematics (Faculty of) by Subject "covering"
Now showing items 1-3 of 3
-
The Edmonds-Giles Conjecture and its Relaxations
(University of Waterloo, 2022-12-23)Given a directed graph, a directed cut is a cut with all arcs oriented in the same direction, and a directed join is a set of arcs which intersects every directed cut at least once. Edmonds and Giles conjectured for all ... -
Packing Unit Disks
(University of Waterloo, 2008-08-27)Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. In this thesis, we consider ... -
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
(University of Waterloo, 2021-01-29)Given a family of sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer ...