Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/5992
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Levner, E | - |
dc.creator | Elalouf, A | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:23:23Z | - |
dc.date.available | 2014-12-11T08:23:23Z | - |
dc.identifier.issn | 0948-695X | - |
dc.identifier.uri | http://hdl.handle.net/10397/5992 | - |
dc.language.iso | en | en_US |
dc.publisher | Graz University of Technology, Institute for Information Systems and Computer Media | en_US |
dc.rights | © J.UCS | en_US |
dc.rights | 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 | en_US |
dc.subject | Mobile agent | en_US |
dc.subject | Constrained routing | en_US |
dc.subject | Constrained longest path | en_US |
dc.subject | Approximation algorithm | en_US |
dc.subject | FPTAS | en_US |
dc.title | An improved FPTAS for mobile agent routing with time constraints | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 1854 | - |
dc.identifier.epage | 1862 | - |
dc.identifier.volume | 17 | - |
dc.identifier.issue | 13 | - |
dc.identifier.doi | 10.3217/jucs-017-13-1854 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of universal computer science, 2011, v. 17, no. 13, p. 1854-1862 | - |
dcterms.isPartOf | Journal of universal computer science | - |
dcterms.issued | 2011 | - |
dc.identifier.isi | WOS:000304607500005 | - |
dc.identifier.scopus | 2-s2.0-83455219335 | - |
dc.identifier.eissn | 0948-6968 | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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
154
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
50
Citations as of Apr 14, 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.