Ideal Clutters
Abstract
Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member is contained in another. The clutter C is ideal if every extreme point of the polyhedron { x>=0 : x(C) >= 1 for every member C } is integral.
Ideal clutters are central objects in Combinatorial Optimization, and they have deep connections to several other areas. To integer programmers, they are the underlying structure of set covering integer programs that are easily solvable. To graph theorists, they are manifest in the famous theorems of Edmonds and Johnson on T-joins, of Lucchesi and Younger on dijoins, and of Guenin on the characterization of weakly bipartite graphs; not to mention they are also the set covering analogue of perfect graphs. To matroid theorists, they are abstractions of Seymour’s sums of circuits property as well as his f-flowing property. And finally, to combinatorial optimizers, ideal clutters host many minimax theorems and are extensions of totally unimodular and balanced matrices.
This thesis embarks on a mission to develop the theory of general ideal clutters.
In the first half of the thesis, we introduce and/or study tools for finding deltas, extended odd holes and their blockers as minors; identically self-blocking clutters; exclusive, coexclusive and opposite pairs; ideal minimally non-packing clutters and the τ = 2 Conjecture; cuboids; cube-idealness; strict polarity; resistance; the sums of circuits property; and minimally non-ideal binary clutters and the f-Flowing Conjecture.
While the first half of the thesis includes many broad and high-level contributions that are accessible to a non-expert reader, the second half contains three deep and technical contributions, namely, a character- ization of an infinite family of ideal minimally non-packing clutters, a structure theorem for ±1-resistant sets, and a characterization of the minimally non-ideal binary clutters with a member of cardinality three.
In addition to developing the theory of ideal clutters, a main goal of the thesis is to trigger further research on ideal clutters. We hope to have achieved this by introducing a handful of new and exciting conjectures on ideal clutters.
Collections
Cite this version of the work
Ahmad Abdi
(2018).
Ideal Clutters. UWSpace.
http://hdl.handle.net/10012/13167
Other formats
Related items
Showing items related by title, author, creator and subject.
-
The Cycling Property for the Clutter of Odd st-Walks
Abdi, Ahmad (University of Waterloo, 2014-01-23)A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only ... -
Automated Pipe Spool Recognition in Cluttered Point Clouds
Czerniawski, Thomas (University of Waterloo, 2016-05-06)Construction management is inextricably linked to the awareness and control of 3D geometry. Progress tracking, quality assurance/quality control, and the location, movement, and assembly of materials are all critical ... -
Mobile Robot Manipulator System Design for Localization and Mapping in Cluttered Environments
Liu, Chia-Sung (University of Waterloo, 2018-06-21)In this thesis, a compact mobile robot has been developed to build real-time 3D maps of hazards and cluttered environments inside damaged buildings for rescue tasks using visual Simultaneous Localization And Mapping ...