arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.11900cs.DSmath.OC
收藏

关于最大覆盖选址问题升级版本的复杂度研究

On the complexity of the upgrading version of the maximal covering location problem

Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía

AI总结:

该研究分析了边长可修改的最大覆盖选址升级问题的复杂度,明确了星型、路径网络在不同参数下的多项式可解与NP难场景,并提出树结构单设施问题的伪多项式算法。

摘要:

本文研究了网络上边长可修改的最大覆盖选址问题升级版本的复杂度。该问题在一般网络上是NP难的,但在部分特定场景下可在多项式时间内求解。本文分析了星型网络与路径网络在不同模型参数假设下的情况:星型网络中,权重均匀时问题可在O(nlogn)时间内求解,权重非均匀时为NP难;路径网络中,单设施问题可在O(n³)时间内求解,而p设施问题即使在成本均匀、存在边长升级上限(每条边的最大升级量)且参数为整数的条件下仍为NP难。此外,本文还为整数参数下树结构的单设施问题设计了一种伪多项式算法。

英文摘要:

In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove that this problem is solvable in polynomial time. The cases of star and path networks combined with different assumptions for the model parameters are analysed. In particular, we obtain that the problem on star networks is solvable in O(nlogn) time for uniform weights and NP-hard for non-uniform weights. On paths, the single facility problem is solvable in O(n^3) time, while the p-facility problem is NP-hard even with uniform costs and upper bounds (maximal upgrading per edge), as well as, integer parameter values. Furthermore, a pseudo-polynomial algorithm is developed for the single facility problem on trees with integer parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑