ZIB-Report
Filtern
Erscheinungsjahr
- 2017 (1)
Dokumenttyp
- ZIB-Report (1)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1)
Gehört zur Bibliographie
- nein (1)
Schlagworte
- Covering (1)
- Factors (1)
- König's Theorem (1)
- Packing (1)
- Total Unimodularity (1)
Institut
17-27
We state purely combinatorial proofs for König- and Hall-type theorems for a wide class of combinatorial optimization problems. Our methods rely on relaxations of the matching and vertex cover problem and, moreover, on the strong coloring properties admitted by bipartite graphs and their generalizations.