Primal Separation and Approximation for the {0,1/2}-closure
Operations Research Letters
2024
57
107156
On the Smoothed Complexity of Combinatorial Local Search
The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP)
Tallinn, Estonia
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2024
On the complexity of a maintenance problem for hierarchical systems
Operations Research Letters
2024
107117
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Mathematics of Operations Research
2023
49
1
578–598