We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total collected revenue is maximized. We study the complexity of different variants of this problem on the line. c 2007 Elsevier B.V. All rights reserved.
Sofie Coene, Frits C. R. Spieksma