Approximation Algorithms for the Team Orienteering Problem

In this paper we study a team orienteering problem, which is to find service paths for multiple vehicles in a network such that the profit sum of serving the nodes in the paths is maximized, subject to the cost budget of each vehicle. This problem has many potential applications in IoT and smart cit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annual Joint Conference of the IEEE Computer and Communications Societies S. 1389 - 1398
Hauptverfasser:	Xu, Wenzheng, Xu, Zichuan, Peng, Jian, Liang, Weifa, Liu, Tang, Jia, Xiaohua, Das, Sajal K.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.07.2020
Schlagworte:	Approximation algorithms Capacitive sensors Dispatching Monitoring Multiple vehicle scheduling Smart cities submodular function team orienteering problem
ISSN:	2641-9874
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!