TY - THES
A1 - Streicher, Manuel
T1 - Uncertainty in Discrete Optimization: Connectivity and Covering
N2 - Dealing with uncertain structures or data has lately been getting much attention in discrete optimization. This thesis addresses two different areas in discrete optimization: Connectivity and covering.
When discussing uncertain structures in networks it is often of interest to determine how many vertices or edges may fail in order for the network to stay connected.
Connectivity is a broad, well studied topic in graph theory. One of the most important results in this area is Menger's Theorem which states that the minimum number of vertices needed to separate two non-adjacent vertices equals the maximum number of internally vertex-disjoint paths between these vertices. Here, we discuss mixed forms of connectivity in which both vertices and edges are removed from a graph at the same time. The Beineke Harary Conjecture states that for any two distinct vertices that can be separated with k vertices and l edges but not with k-1 vertices and l edges or k vertices and l-1 edges there exist k+l edge-disjoint paths between them of which k+1 are internally vertex-disjoint. In contrast to Menger's Theorem, the existence of the paths is not sufficient for the connectivity statement to hold. Our main contribution is the proof of the Beineke Harary Conjecture for the case that l equals 2.
We also consider different problems from the area of facility location and covering. We regard problems in which we are given sets of locations and regions, where each region has an assigned number of clients. We are now looking for an allocation of suppliers into the locations, such that each client is served by some supplier. The notable difference to other covering problems is that we assume that each supplier may only serve a fixed number of clients which is not part of the input. We discuss the complexity and solution approaches of three such problems which vary in the way the clients are assigned to the suppliers.
KW - Graph Theory
KW - Connectivity
KW - Mixed Connectivity
KW - Cycle Decomposition
KW - Robust Optimization
KW - Multiset Multicover
Y1 - 2021
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/6555
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-65558
SN - 978-3-8439-4683-4
PB - Verlag Dr. Hut
CY - München
ER -