Mobile agent routing with time constraints: a resource constrained longest-path approach

MaRDI QIDQ4929399zbMATH OpenFDO

Authors Eduardo Camponogara, R. Boveto Shima

Publication date 22 September 2010

Full work available at URL http://www.jucs.org/jucs_16_3/mobile_agent_routing_with

zbMATH Keywords

approximation algorithmsconstrained longest-pathconstrained routingdynamic programmingmobile agents

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42) Approximation algorithms (68W25) Dynamic programming (90C39)

Recommendations

• An improved FPTAS for mobile agent routing with time constraints
• Fast algorithms for mobile agent routing with node-wise constraints in communications networks
• Route planning for agent-based information retrieval
• The traveling agent problem
• scientific article; zbMATH DE number 1927275

Cited in

(8)

• Strongly polynomial FPTASes for monotone dynamic programs
• Low-cost itineraries for multi-hop agents designed for scalable monitoring of multiple subnets
• An improved FPTAS for mobile agent routing with time constraints
• scientific article; zbMATH DE number 1927275 (Why is no real title available?)
• scientific article; zbMATH DE number 2112481 (Why is no real title available?)
• Fast approximation algorithms for routing problems with hop-wise constraints
• Fast algorithms for mobile agent routing with node-wise constraints in communications networks
• The traveling agent problem

This page was built for publication: Mobile agent routing with time constraints: a resource constrained longest-path approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929399)