16 citations · 20 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 3 cited
Improved Approximation Algorithms for Relay Placement
Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell +2
In the relay placement problem the input is a set of sensors and a number , the communication range of a relay. In the one-tier version of the problem the objective is to…
cs.DS2008★ 16 cited
The Minimum Backlog Problem
Michael A. Bender, Sándor P. Fekete, Alexander Kröller +4
We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-perso…