Arun Kumar Das

Charging Station Placement for Anonymous Mobile Agents: A Parameterized Complexity Perspective

We study the problem of optimally placing charging stations for a set of k anonymous mobile agents, each of which must reach a distinct terminal. The agents are identical and can travel only up to a given distance r on a single charge. The objective is to find a placement of charging stations so tha