Seguir
Ruben Hoeksma
Título
Citado por
Citado por
Ano
Posted price mechanisms for a random stream of customers
J Correa, P Foncea, R Hoeksma, T Oosterwijk, T Vredeveld
Proceedings of the 2017 ACM Conference on Economics and Computation, 169-186, 2017
1742017
Recent Developments in Prophet Inequalities
J Correa, P Foncea, R Hoeksma, T Oosterwijk, T Vredeveld
ACM SIGecom Exchanges, 2019
902019
The price of anarchy for minsum related machine scheduling
R Hoeksma, M Uetz
International workshop on approximation and online algorithms, 261-273, 2011
372011
Posted price mechanisms and optimal threshold strategies for random arrivals
J Correa, P Foncea, R Hoeksma, T Oosterwijk, T Vredeveld
Mathematics of operations research 46 (4), 1452-1478, 2021
362021
Paging with succinct predictions
A Antoniadis, J Boyar, M Eliás, LM Favrholdt, R Hoeksma, KS Larsen, ...
International Conference on Machine Learning, 952-968, 2023
212023
Scheduling self-suspending tasks: New and old results
JJ Chen, T Hahn, R Hoeksma, N Megow, G von der Brüggen
31st Euromicro Conference on Real-Time Systems, ECRTS 2019, 1-23, 2019
172019
The price of anarchy for utilitarian scheduling games on related machines
R Hoeksma, M Uetz
Discrete optimization 31, 29-39, 2019
172019
A PTAS for Euclidean TSP with hyperplane neighborhoods
A Antoniadis, K Fleszar, R Hoeksma, K Schewior
ACM Transactions on Algorithms (TALG) 16 (3), 1-16, 2020
142020
Two dimensional optimal mechanism design for a sequencing problem
R Hoeksma, M Uetz
International Conference on Integer Programming and Combinatorial …, 2013
132013
Speed-robust scheduling: sand, bricks, and rocks
F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon
Mathematical Programming 197 (2), 1009-1048, 2023
122023
Network congestion games are robust to variable demand
J Correa, R Hoeksma, M Schröder
Transportation Research Part B: Methodological 119, 69-78, 2019
122019
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types
R Hoeksma, M Uetz
Operations research 64 (6), 1438-1450, 2016
102016
Approximability of connected factors
K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, CS Rahul
International Workshop on Approximation and Online Algorithms, 120-131, 2013
102013
A QPTAS for the general scheduling problem with identical release dates
A Antoniadis, R Hoeksma, J Meißner, J Verschae, A Wiese
Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017
92017
Approximation algorithms for connected graph factors of minimum weight
K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, CS Rahul, ...
Theory of computing systems 62 (2), 441-464, 2018
82018
On the complexity of anchored rectangle packing
A Antoniadis, F Biermeier, A Cristi, C Damerius, R Hoeksma, D Kaaser, ...
27th Annual European Symposium on Algorithms (ESA 2019), 8: 1-8: 14, 2019
62019
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope
R Hoeksma, B Manthey, M Uetz
Discrete applied mathematics 215, 136-145, 2016
52016
Decomposition algorithm for the single machine scheduling polytope
R Hoeksma, B Manthey, M Uetz
International Symposium on Combinatorial Optimization, 280-291, 2014
52014
Online search for a hyperplane in high-dimensional Euclidean space
A Antoniadis, R Hoeksma, S Kisfaludi-Bak, K Schewior
Information processing letters 177, 106262, 2022
42022
A better lower bound for Lower-Left Anchored Rectangle Packing
R Hoeksma, M Maat
arXiv preprint arXiv:2102.05747, 2021
32021
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20