16 citations · 29 across the 19 of their papers we have counts for
3 papers · 1 filter
Popular Branchings and Their Dual Certificates
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
Let be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed forests; a…
Exact and approximation algorithms for the expanding search problem
Ben Hermans, Roel Leus, Jannik Matuschke
Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence o…
Malleable scheduling beyond identical machines
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. In this setting, jobs…