受强制性开放获取政策约束的文章 - Lars Rohwedder了解详情
无法在其他位置公开访问的文章：2 篇
Structured instances of restricted assignment with two processing times
K Jansen, L Rohwedder
Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017
强制性开放获取政策： German Research Foundation
Online cardinality constrained scheduling
L Epstein, A Lassota, A Levin, M Maack, L Rohwedder
Operations Research Letters 51 (5), 533-539, 2023
强制性开放获取政策： Swiss National Science Foundation, German Research Foundation
可在其他位置公开访问的文章：22 篇
On integer programming, discrepancy, and convolution
K Jansen, L Rohwedder
Mathematics of Operations Research, 2022
强制性开放获取政策： German Research Foundation
Learning augmented energy minimization via speed scaling
É Bamas, A Maggiori, L Rohwedder, O Svensson
Advances in Neural Information Processing Systems 33, 15350-15359, 2020
强制性开放获取政策： Swiss National Science Foundation
Block-structured integer and linear programming in strongly polynomial and near linear time
J Cslovjecsek, F Eisenbrand, C Hunkenschröder, L Rohwedder, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： Swiss National Science Foundation
Near-Linear Time Algorithm for -Fold ILPs via Color Coding
K Jansen, A Lassota, L Rohwedder
SIAM Journal on Discrete Mathematics 34 (4), 2282-2299, 2020
强制性开放获取政策： German Research Foundation
On the configuration-lp of the restricted assignment problem
K Jansen, L Rohwedder
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
强制性开放获取政策： German Research Foundation
A quasi-polynomial approximation for the restricted assignment problem
K Jansen, L Rohwedder
SIAM Journal on Computing 49 (6), 1083-1108, 2020
强制性开放获取政策： German Research Foundation
A note on the integrality gap of the configuration LP for restricted Santa Claus
K Jansen, L Rohwedder
Information Processing Letters 164, 106025, 2020
强制性开放获取政策： German Research Foundation
Online bin covering with limited migration
S Berndt, L Epstein, K Jansen, A Levin, M Maack, L Rohwedder
arXiv preprint arXiv:1904.06543, 2019
强制性开放获取政策： German Research Foundation
On minimizing tardy processing time, max-min skewed convolution, and triangular structured ILPs
KM Klein, A Polak, L Rohwedder
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
强制性开放获取政策： Swiss National Science Foundation, German Research Foundation
Flow time scheduling and prefix beck-fiala
N Bansal, L Rohwedder, O Svensson
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
强制性开放获取政策： Swiss National Science Foundation, Netherlands Organisation for Scientific …
Load balancing: The long road from theory to practice
S Berndt, MA Deppert, K Jansen, L Rohwedder
2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022
强制性开放获取政策： German Research Foundation
Approximation results for makespan minimization with budgeted uncertainty
M Bougeret, K Jansen, M Poss, L Rohwedder
Theory of Computing Systems 65, 903-915, 2021
强制性开放获取政策： German Research Foundation, Agence Nationale de la Recherche
Towards Non-Uniform k-Center with Constant Types of Radii
X Jia, L Rohwedder, K Sheth, O Svensson
Symposium on Simplicity in Algorithms (SOSA), 228-237, 2022
强制性开放获取政策： Swiss National Science Foundation
A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine
L Rohwedder, A Wiese
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
强制性开放获取政策： Swiss National Science Foundation
Compact LP relaxations for allocation problems
K Jansen, L Rohwedder
1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018
强制性开放获取政策： German Research Foundation
Better trees for santa claus
É Bamas, L Rohwedder
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1862-1875, 2023
强制性开放获取政策： Swiss National Science Foundation, Netherlands Organisation for Scientific …
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
É Bamas, A Lindermayr, N Megow, L Rohwedder, J Schlöter
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
强制性开放获取政策： Swiss National Science Foundation, Netherlands Organisation for Scientific …
Optimizing low dimensional functions over the integers
D Dadush, A Léonard, L Rohwedder, J Verschae
International Conference on Integer Programming and Combinatorial …, 2023
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定