35 citations · 66 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
How hard is it to satisfy (almost) all roommates?
Jiehua Chen, Danny Hermelin, Manuel Sorge +1
The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set o…
cs.NI2017★ 2 cited
Coordination of Mobile Mules via Facility Location Strategies
Danny Hermelin, Michael Segal, Harel Yedidsion
In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way tha…