Polynomial time algorithms for the message routing problem

被引：0

作者：

Wong, CS ^{[1
]}

Chan, P ^{[1
]}

机构：

[1] San Francisco State Univ, Dept Comp Sci, San Francisco, CA 94132 USA

来源：

INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS | 1998年

关键词：

message routing; ring network; polynomial time algorithm; NP-complete problem; nonpreemptive transmission; release time; deadline; mean flow time;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The problem of determining whether a set of messages can be routed in an unidirectional ring was studied by Leung, et al. They presented complexity results under various restrictions of four parameters : origin node, destination node, release time and deadline. For nonpreemptive transmission they showed that the problem is solvable in polynomial time when any of the four parameter is allowed to be arbitrary, and that it becomes NP-complete when any two of them are fixed. In this paper, we continue to study the problem to minimize the mean flow time of messages with respect to the nonpreemptive transmission. We show that the problem is solvable in polynomial time when destination node or deadline is allowed to be arbitrary.

引用

页码：995 / 1000

页数：6

共 50 条

[31] Polynomial time certifying algorithms for the planar quantified integer programming problem
Liang, Z.
Subramani, K.
Worthington, J.
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (05) : 1017 - 1033
[32] Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem
Chateau, Annie
Giroudeau, Rodolphe
[J]. ALGORITHMS FOR COMPUTATIONAL BIOLOGY, 2014, 8542 : 47 - 58
[33] A polynomial time optimal diode insertion/routing algorithm for fixing antenna problem
Huang, LD
Tang, XP
Xiang, H
Wong, DF
Liu, IM
[J]. DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, 2002 PROCEEDINGS, 2002, : 470 - 475
[34] The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time
Letchford, Adam N.
Salazar-Gonzalez, Juan-Jose
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (01) : 24 - 31
[35] Vehicle routing problem with time windows using natural inspired algorithms
Pratiwi, A. B.
Pratama, A.
Sa'diyah, I.
Suprajitno, H.
[J]. INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2018, 974
[36] Algorithms for vehicle routing problem with stochastic demand with soft time window
Li, Guoming
Li, Junhua
[J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (08): : 2270 - 2281
[37] Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows
Bramel, J
SimchiLevi, D
[J]. OPERATIONS RESEARCH, 1996, 44 (03) : 501 - 509
[38] Exact Algorithms for the Vehicle Routing Problem With Time Windows and Combinatorial Auction
Zhang, Zhenzhen
Luo, Zhixing
Qin, Hu
Lim, Andrew
[J]. TRANSPORTATION SCIENCE, 2019, 53 (02) : 427 - 441
[39] Models and Algorithms for the Vehicle Routing Problem with Time Windows and Other Conditions
Guzairov, M. B.
Yusupova, N., I
Smetanina, O. N.
Rassadnikova, E. Yu
[J]. 2016 13TH INTERNATIONAL SCIENTIFIC-TECHNICAL CONFERENCE ON ACTUAL PROBLEMS OF ELECTRONIC INSTRUMENT ENGINEERING (APEIE), VOL 2, 2016, : 412 - 416
[40] Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
Hsing-Yen Ann
Chang-Biau Yang
Chiou-Ting Tseng
[J]. Journal of Combinatorial Optimization, 2014, 28 : 800 - 813

← 1 2 3 4 5 →