Authorization

 

Journal

Volume 11, №2, Special Issue on Applied Artificial Intelligence and Soft Computing


Fast Algorithms for Mobile Agent Routing with Node-Wise Constraints in Communications Networks (pages 214-226)
Amir Elalouf, Eugene Levner, T.C.E. Cheng


Abstract. We consider the multi-constraint agent routing problem in a graph that seeks to find a maximum-benefit (or minimum-cost) route for each agent subject to quality-of-service constraints. We derive a fully polynomial-time approximation scheme (FPTAS) that extends and improves a known FPTAS for the single-constraint routing problem.

Keywords: Multi-Agent Distributed Systems, Mobile Agent, Agent Routing, Routing Algorithm, FPTAS, Acceleration Technique.

AMS Subject Classification: 90B10, 90C39, 68Q17, 68Q25.


COIA 2027

7-9 July 2027
Baku, Azerbaijan

Search