|
1 |
An Architecture for Composite Combinatorial Optimization Solvers
Chrit, Khalil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
2 |
Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems
Montañez-Barrera, J. A.. - Aachen : Universitätsbibliothek der RWTH Aachen, 2025
|
|
|
3 |
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization
Enthalten in Mathematical programming 1.7.2025: 1-12
|
|
|
|
4 |
Combinatorial optimization: From deep learning to large language models
Enthalten in Science China / Mathematics 30.4.2025: 1-19
|
|
|
|
5 |
A Quantum Framework for Combinatorial Optimization Problem over Graphs
Enthalten in Data science and engineering 24.1.2025: 1-12
|
|
|
|
6 |
A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
Sun, Hao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
7 |
A Logarithmic Approximation of Linearly-Ordered Colourings
Håstad, Torkel Johan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
8 |
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
Tětek, Jakub. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
9 |
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
Doron-Arad, Ilan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
10 |
Approximate Degree Composition for Recursive Functions
Chakraborty, Sourav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
