19 citations · 38 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 9 cited
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Pavel Dvořák, Andreas Emil Feldmann, Dušan Knop +3
We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensive…
cs.DS2017
On Packet Scheduling with Adversarial Jamming and Speedup
Martin Böhm, Łukasz Jeż, Jiří Sgall +1
In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chos…