Fast algorithms for mobile agent routing with node-wise constraints in communications networks

Amir Elalouf; Eugene Levner; T. C.E. Cheng

Fast algorithms for mobile agent routing with node-wise constraints in communications networks

Amir Elalouf, Eugene Levner, T. C.E. Cheng

Department of Management

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	214-226
Number of pages	13
Journal	Applied and Computational Mathematics
Volume	11
Issue number	2
State	Published - 2012

Keywords

Acceleration technique
Agent routing
FPTAS
Mobile agent
Multi-agent distributed systems
Routing algorithm

Cite this

@article{2324ba7dd1694ca39dcea490656dec92,

title = "Fast algorithms for mobile agent routing with node-wise constraints in communications networks",

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 = "Acceleration technique, Agent routing, FPTAS, Mobile agent, Multi-agent distributed systems, Routing algorithm",

author = "Amir Elalouf and Eugene Levner and Cheng, {T. C.E.}",

year = "2012",

language = "אנגלית",

volume = "11",

pages = "214--226",

journal = "Applied and Computational Mathematics",

issn = "1683-3511",

publisher = "Institute of Applied Mathematics of Baku State University",

number = "2",

}

TY - JOUR

T1 - Fast algorithms for mobile agent routing with node-wise constraints in communications networks

AU - Elalouf, Amir

AU - Levner, Eugene

AU - Cheng, T. C.E.

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Acceleration technique

KW - Agent routing

KW - FPTAS

KW - Mobile agent

KW - Multi-agent distributed systems

KW - Routing algorithm

UR - http://www.scopus.com/inward/record.url?scp=84865203892&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84865203892

SN - 1683-3511

VL - 11

SP - 214

EP - 226

JO - Applied and Computational Mathematics

JF - Applied and Computational Mathematics

IS - 2

ER -

Fast algorithms for mobile agent routing with node-wise constraints in communications networks

Abstract

Keywords

Other files and links

Fingerprint

Cite this