research
∙
12/18/2022
Unconstrained Traveling Tournament Problem is APX-complete
We show that the Unconstrained Traveling Tournament Problem (UTTP) is AP...
share
research
∙
11/17/2022
Extensions of the (p,q)-Flexible-Graph-Connectivity model
We present approximation algorithms for network design problems in some ...
research
∙
09/22/2022
Approximating (p,2) flexible graph connectivity via the primal-dual method
We consider the Flexible Graph Connectivity model (denoted FGC) introduc...
research
∙
02/27/2022
Approximation Algorithms for Flexible Graph Connectivity
We present approximation algorithms for several network design problems ...
research
∙
11/15/2021
On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs
Our motivation is to improve on the best approximation guarantee known f...
research
∙
04/13/2021
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
The Moore-Hodgson Algorithm minimizes the number of late jobs on a singl...
research
∙
02/05/2021