16 citations · 29 across the 19 of their papers we have counts for
9 papers · 1 filter
When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
Max Klimm, Jannik Matuschke
Consider a finite ground set , a set of feasible solutions , and a class of objective functions defined on . We are interested in su…
Simultaneous Network Design with Restricted Link Usage
Naonori Kakimura, Péter Madarasi, Jannik Matuschke +1
Given a digraph with two terminal vertices and as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to fin…
On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
Umang Bhaskar, Katharina Eickhoff, Lennart Kauther +3
In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requi…
The popular assignment problem: when cardinality is more important than popularity
Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2
We consider a matching problem in a bipartite graph where nodes in are agents having preferences in partial order over their neighbors, while nodes in are o…
Single-machine scheduling with an external resource
Dirk Briskorn, Morteza Davari, Jannik Matuschke
This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are ex…
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…