10 citations · 13 across the 7 of their papers we have counts for
7 papers
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, Kim Klause, Jochen Koenemann +1
Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume need…
Sorting and Hypergraph Orientation under Uncertainty with Predictions
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow +1
Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of unce…
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
Alexander Lindermayr, Nicole Megow, Martin Rapp
We consider online scheduling on unrelated (heterogeneous) machines in a speed-oblivious setting, where an algorithm is unaware of the exact job-dependent processing speeds. We sho…
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
Alexandra Lassota, Alexander Lindermayr, Nicole Megow +1
We consider non-clairvoyant scheduling with online precedence constraints, where an algorithm is oblivious to any job dependencies and learns about a job only if all of its predece…
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Elisabeth Günther, Olaf Maurer, Nicole Megow +1
We propose a new approach to competitive analysis in online scheduling by introducing the novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically co…