Abstract: The rooted max tree coverage (MTC) problem has wide applications in areas, such as network design and vehicle routing. Given a graph with non-negative costs defined on edges, a vertex used ...
Abstract: Task allocation is a key issue in multi-agent systems, and finding the optimal strategy for task allocation has been proved to be an NP-hard problem. Existing task allocation methods for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback