50 citations · 97 across the 11 of their papers we have counts for
3 papers · 1 filter
Parameterized Complexity of Efficient Sortation
Robert Ganian, Hung P. Hoang, Simon Wietheger
A crucial challenge arising in the design of large-scale logistical networks is to optimize parcel sortation for routing. We study this problem under the recent graph-theoretic for…
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger, Benjamin Doerr
Despite significant progress in the field of mathematical runtime analysis of multi-objective evolutionary algorithms (MOEAs), the performance of MOEAs on discrete many-objective p…
A Structural Complexity Analysis of Hierarchical Task Network Planning
Cornelius Brand, Robert Ganian, Fionn Mc Inerney +1
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an…