4 papers
Node Connectivity Augmentation via Iterative Randomized Rounding
Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità
Many network design problems deal with the design of low-cost networks that are resilient to the failure of their elements, such as nodes or links. One such problem is Connectivity…
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
Georg Anegg, Haris Angelidakis, Rico Zenklusen
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-uniform hypergraph matching states that for any hypergraph with edge weights , there exists a matching suc…
A Technique for Obtaining True Approximations for -Center with Covering Constraints
Georg Anegg, Haris Angelidakis, Adam Kurpisz +1
There has been a recent surge of interest in incorporating fairness aspects into classical clustering problems. Two recently introduced variants of the -Center problem in this s…
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
Haris Angelidakis
In this thesis, we design algorithms for several NP-hard problems in both worst and beyond worst case settings. In the first part of the thesis, we apply the traditional worst case…