An improved FPTAS for mobile agent routing with time constraints

MaRDI QIDQ2917206zbMATH OpenFDO

Authors Eugene Levner, Amir Elalouf, T. C. Edwin Cheng

Publication date 27 September 2012

Published in Journal of Universal Computer Science (Search for Journal in Brave)

Full work available at URL http://www.jucs.org/jucs_17_13/an_improved_FPTAS_for

zbMATH Keywords

approximation algorithmconstrained longest pathconstrained routingFPTASmobile agent

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Fast algorithms for mobile agent routing with node-wise constraints in communications networks
• Mobile agent routing with time constraints: a resource constrained longest-path approach
• An improved FPTAS for Restricted Shortest Path.
• The traveling agent problem
• Fast approximation algorithms for routing problems with hop-wise constraints

Cited in

(6)

• Strongly polynomial FPTASes for monotone dynamic programs
• Improving the solution complexity of the scheduling problem with deadlines: a general technique
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
• Fast approximation algorithms for routing problems with hop-wise constraints
• Mobile agent routing with time constraints: a resource constrained longest-path approach
• Fast algorithms for mobile agent routing with node-wise constraints in communications networks

This page was built for publication: An improved FPTAS for mobile agent routing with time constraints

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