Scholarlink

This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable in general digraphs. Polynomial-time algorithms for the problem under consideration in DAGs are proposed.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Solving the Recoverable Robust Shortest Path Problem in DAGs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Marcel Jackiewicz,
  • Adam Kasperski,
  • Paweł Zieliński

摘要

This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable in general digraphs. Polynomial-time algorithms for the problem under consideration in DAGs are proposed.