1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
cs.DS2018
Maximal Exploration of Trees with Energy-Constrained Agents
Evangelos Bampas, Jérémie Chalopin, Shantanu Das +2
We consider the problem of exploring an unknown tree with a team of initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than…