research
∙
06/14/2023
Recoverable Robust Optimization with Commitment
We propose a model for recoverable robust optimization with commitment. ...
share
research
∙
01/09/2023
Improved Approximation Algorithms for the Expanding Search Problem
A searcher faces a graph with edge lengths and vertex weights, initially...
research
∙
11/03/2022
Matching Augmentation via Simultaneous Contractions
We consider the matching augmentation problem (MAP), where a matching of...
research
∙
05/18/2021
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
We investigate the complexity of bilevel combinatorial optimization with...
research
∙
12/23/2020
On the Complexity of the Bilevel Minimum Spanning Tree Problem
We consider the bilevel minimum spanning tree (BMST) problem where the l...
research
∙
11/20/2020
Fixed-Parameter Algorithms for Graph Constraint Logic
Non-deterministic constraint logic (NCL) is a simple model of computatio...
research
∙
09/10/2020
Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults
The overwhelming majority of survivable (fault-tolerant) network design ...
research
∙
10/29/2019
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
Graph connectivity and network design problems are among the most fundam...
research
∙
05/03/2018