关于环加载问题的一个注记
A note on the ring loading problem
摘要：
环负载问题是在使用双向SONET环的光通信网络的规划中出现的最优路由问题。在数学术语中，它是无向环网络上的不可分裂多商品流问题。我们证明了任何分裂路由解决方案的环加载问题可以变成一个unsplittable解决方案，而增加的负载在任何边缘的环不超过+（19/14）D，其中D是最大的需求值。这改进了Schrijver，Seymour，and Winkler（1998）的经典结果，他们得到了一个稍大的+（3/2）D的界。我们还提出了一个改进的下界+1.1 D（以前+1.01 D）的最佳可能的界限和反驳著名的长期存在的猜想Schrijver等人。在这种情况下。
英文摘要：
The Ring Loading Problem is an optimal routing problem arising in the planning of optical communication networks which use bidirectional SONET rings. In mathematical terms, it is an unsplittable multicommodity flow problem on undirected ring networks. We prove that any split routing solution to the Ring Loading Problem can be turned into an unsplittable solution while increasing the load on any edge of the ring by no more than +(19/14)D, where D is the maximum demand value. This improves upon a classical result of Schrijver, Seymour, and Winkler (1998) who obtained a slightly larger bound of +(3/2)D. We also present an improved lower bound of +1.1 D (previously +1.01 D) on the best possible bound and disprove a famous long-standing conjecture of Schrijver et al. in this context.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
