Download Kinetic Maintenance of Mobile k-Centres on Trees
Queue processing for download document Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-centre and 2-centre of C. When each client in C moves with linear motion along
You can start your download in 30 seconds