Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jackiewicz, Marcel, Kasperski, Adam, Zieliński, Paweł
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
par: Marcel Jackiewicz, et autres
Publié: (2024)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
par: Jackiewicz, Marcel, et autres
Publié: (2024)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
par: Grüne, Christoph
Publié: (2022)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
par: Przybyłek, Michał R., et autres
Publié: (2026)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
par: Grüne, Christoph, et autres
Publié: (2024)

Parameterized Shortest Path Reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2024)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
par: Do, Phuc Hao, et autres
Publié: (2025)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2022)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
par: Assadi, Sepehr, et autres
Publié: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

On Computational Aspects of Ordered Matching Problems
par: Čertík, Michal, et autres
Publié: (2025)

On Computability of Computable Problems
par: Khaliq, Asad
Publié: (2023)

Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs
par: Ruszil, Jakub, et autres
Publié: (2026)

Parameterized Complexity of the Star Decomposition Problem
par: Hajebi, Sahab, et autres
Publié: (2024)

On the Complexity of Problems on Tree-structured Graphs
par: Bodlaender, Hans L., et autres
Publié: (2022)

The Radical Solution and Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2024)

The Computational Complexity of Factored Graphs
par: Gupta, Shreya, et autres
Publié: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
par: Gilfanov, Arthur
Publié: (2024)

Random Permutations in Computational Complexity
par: Hitchcock, John M., et autres
Publié: (2025)

Arborescences and Shortest Path Trees when Colors Matter
par: Ardra, P. S., et autres
Publié: (2024)

Discrete Homotopy and Promise Constraint Satisfaction Problem
par: Beikmohammadi, Arash, et autres
Publié: (2025)

Computational Complexity of Game Boy Games
par: Tirmazi, Hayder, et autres
Publié: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2026)

Complexity Thresholds for the Constrained Colored Token Swapping Problem
par: Bilò, Davide, et autres
Publié: (2026)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
par: Cavalar, Bruno P., et autres
Publié: (2025)

Complexity of Nonassociative Lambek Calculus with classical logic
par: Płaczek, Paweł
Publié: (2024)

Assembly Theory and its Relationship with Computational Complexity
par: Kempes, Christopher P., et autres
Publié: (2024)

The Parameterized Complexity of Computing the Linear Vertex Arboricity
par: Erhardt, Alexander, et autres
Publié: (2025)

An Overview of the Theory of Instances Computational Complexity
par: Jorge A. Ruiz-Vanoye
Publié: (2011)

Approximating the shortest path problem with scenarios
par: Kasperski, Adam, et autres
Publié: (2018)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
par: Doron, Dean, et autres
Publié: (2024)

Reverse-Robust Computation with Chemical Reaction Networks
par: Kini, Ravi, et autres
Publié: (2026)

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
par: Takahata, Takuma, et autres
Publié: (2025)

Scheme-Theoretic Approach to Computational Complexity. III. SETH
par: Çivril, Ali
Publié: (2023)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
par: Daghbouche, Karim
Publié: (2025)

The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side
par: Asimi, Kristina, et autres
Publié: (2024)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
par: Lauerbach, Antonio, et autres
Publié: (2024)

Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
par: Hörsch, Florian, et autres
Publié: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
par: Saha, Barna, et autres
Publié: (2024)