|
1 |
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
Li, Qian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
2 |
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Bumpus, Benjamin Merlin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
3 |
Online Bin Covering with Frequency Predictions
Berg, Magnus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
4 |
A fast $$(2 + \frac2}7})$$ ( 2 + 2 7 ) -approximation algorithm for capacitated cycle covering
Enthalten in Mathematical programming 29.6.2021: 1-22
|
|
|
|
5 |
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
Fielbaum, Andrés. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
6 |
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
Hong, Eunpyeong. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
7 |
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
Liu, Sixue. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
Administration
