具有离散追索权的可恢复稳健最短路径问题的计算复杂性

arXiv - CS - Computational Complexity Pub Date : 2024-03-29 DOI:arxiv-2403.20000

Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński

{"title":"具有离散追索权的可恢复稳健最短路径问题的计算复杂性","authors":"Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński","doi":"arxiv-2403.20000","DOIUrl":null,"url":null,"abstract":"In this paper the recoverable robust shortest path problem is investigated.\nDiscrete budgeted interval uncertainty representation is used to model\nuncertain second-stage arc costs. The known complexity results for this problem\nare strengthened. It is shown that it is Sigma_3^p-hard for the arc exclusion\nand the arc symmetric difference neighborhoods. Furthermore, it is also proven\nthat the inner adversarial problem for these neighborhoods is Pi_2^p-hard.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":"49 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse\",\"authors\":\"Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński\",\"doi\":\"arxiv-2403.20000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the recoverable robust shortest path problem is investigated.\\nDiscrete budgeted interval uncertainty representation is used to model\\nuncertain second-stage arc costs. The known complexity results for this problem\\nare strengthened. It is shown that it is Sigma_3^p-hard for the arc exclusion\\nand the arc symmetric difference neighborhoods. Furthermore, it is also proven\\nthat the inner adversarial problem for these neighborhoods is Pi_2^p-hard.\",\"PeriodicalId\":501024,\"journal\":{\"name\":\"arXiv - CS - Computational Complexity\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2403.20000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2403.20000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了可恢复鲁棒最短路径问题，并使用离散预算区间不确定性表示法对不确定的第二阶段弧成本进行建模。该问题的已知复杂度结果得到了加强。结果表明，对于弧排除和弧对称差邻域，该问题的复杂度为 Sigma_3^p-hard。此外，还证明了这些邻域的内部对抗问题是 Pi_2^p 难的。

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

查看原文本刊更多论文

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse

In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted interval uncertainty representation is used to model uncertain second-stage arc costs. The known complexity results for this problem are strengthened. It is shown that it is Sigma_3^p-hard for the arc exclusion and the arc symmetric difference neighborhoods. Furthermore, it is also proven that the inner adversarial problem for these neighborhoods is Pi_2^p-hard.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Computational Complexity

自引率

0.00%

发文量