Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/5992
Title: | An improved FPTAS for mobile agent routing with time constraints | Authors: | Levner, E Elalouf, A Cheng, TCE |
Issue Date: | 2011 | Source: | Journal of universal computer science, 2011, v. 17, no. 13, p. 1854-1862 | Abstract: | Camponogara and Shima (2010) developed an ε-approximation algorithm (FPTAS) for the mobile agent routing problem in which a benefit function determines how visits to different sites contribute to the agent’s mission. The benefit is to be maximized under a time constraint. They reduced the problem to the constrained longest-path problem in a graph. In this note we present a modified FPTAS that improves on their result by a factor of [refer to publisher pdf], where [refer to publisher pdf] are an upper bound and a lower bound on the maximum benefit, respectively, n is the number of nodes, and h is the length of the longest path (in hops) in the graph. | Keywords: | Mobile agent Constrained routing Constrained longest path Approximation algorithm FPTAS |
Publisher: | Graz University of Technology, Institute for Information Systems and Computer Media | Journal: | Journal of universal computer science | ISSN: | 0948-695X | EISSN: | 0948-6968 | DOI: | 10.3217/jucs-017-13-1854 | Rights: | © J.UCS The following article "Levner, E., Elalouf, A.,& Cheng, T.C.E. (2011). An Improved FPTAS for mobile agent routing with time constraints. Journal of Universal Computer Science, 17(13), 1854-1862." is available at http://dx.doi.org/10.3217/jucs-017-13-1854 |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Levner_FPTAS_Mobile_Agent.pdf | 152.17 kB | Adobe PDF | View/Open |
Page views
155
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
50
Citations as of Apr 21, 2024
SCOPUSTM
Citations
14
Last Week
0
0
Last month
1
1
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
13
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.