Computing minimal solutions to the ring loading problem

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-11-30 DOI:10.1016/j.ipl.2023.106466

Nikolas Klug

引用次数: 0

Abstract

Given a cycle graph of n nodes and a non-negative demand $d_{i, j}$ for each pair of nodes $i, j$ , the ring loading problem with demand splitting (RLPW) asks to determine a routing of these demands such that the maximum load on any edge is minimal. In this work, we present an algorithm for computing minimal solutions to RLPW in $O (n^{2})$ time. This algorithm, when employed as a subroutine, also improves the runtimes for several other ring loading algorithms by a factor of up to $O (n^{2})$ .

查看原文本刊更多论文

计算环载荷问题的最小解

给定一个n个节点的循环图，对于每一对节点i,j，都有一个非负的需求di,j，需求分割的环加载问题(RLPW)要求确定这些需求的路由，使任何边的最大负载最小。在这项工作中，我们提出了一种在O(n2)时间内计算RLPW最小解的算法。该算法作为子例程使用时，还可以将其他几个环加载算法的运行时间提高至多O(n2)倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.