1 citations · 1 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
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…
cs.DS2019
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times
Kristóf Bérczi, Tamás Király, Simon Omlor
The paper considers single-machine scheduling problems with a non-renewable resource. In this setting, we are given a set jobs, each of which is characterized by a processing time,…