Cover Image

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grüne, Christoph, Wulf, Lasse
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Discrete Mathematics Optimization and Control F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
by: Grüne, Christoph, et al.
Published: (2023)

The Complexity of Blocking All Solutions
by: Grüne, Christoph, et al.
Published: (2025)

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property
by: Bartlett, Celina Janet
Published: (2025)

Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
by: Istrate, Gabriel
Published: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)

A Decomposition Approach to the Weighted $k$-server Problem
by: Ayyadevara, Nikhil, et al.
Published: (2024)

On Finding Randomly Planted Cliques in Arbitrary Graphs
by: Agrimonti, Francesco, et al.
Published: (2025)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

On the Complexity of Problems on Graphs Defined on Groups
by: Das, Bireswar, et al.
Published: (2025)

Diffusion-Robust Optimization over Graphs
by: Aolaritei, Liviu, et al.
Published: (2026)

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
by: Bok, Jan, et al.
Published: (2025)

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, et al.
Published: (2023)

On the complexity of a maintenance problem for hierarchical systems
by: Schulz, Andreas S., et al.
Published: (2023)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
by: Pavlov, Gorgi
Published: (2026)

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
by: Goldberg, Noam, et al.
Published: (2026)

On the hull and interval numbers of oriented graphs
by: Araujo, J., et al.
Published: (2022)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

APTAS for bin packing with general cost structures
by: Jaykrishnan, G., et al.
Published: (2024)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
by: Giambartolomei, Giordano, et al.
Published: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
by: Giambartolomei, Giordano, et al.
Published: (2023)

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
by: Asadi, Ali, et al.
Published: (2025)

The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm
by: Silva, Mateus C., et al.
Published: (2024)

Sum-of-squares lower bounds for Non-Gaussian Component Analysis
by: Diakonikolas, Ilias, et al.
Published: (2024)

On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
by: Wittwer, David, et al.
Published: (2024)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
by: Ciardo, Lorenzo, et al.
Published: (2022)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Treewidth Inapproximability and Tight ETH Lower Bound
by: Bonnet, Édouard
Published: (2024)

Mim-Width is paraNP-complete
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Answering Related Questions
by: Bonnet, Édouard
Published: (2025)

Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs
by: Anand, Emile
Published: (2025)

Coloring Hardness on Low Twin-Width Graphs
by: Bonnet, Édouard
Published: (2025)

Neural Networks and (Virtual) Extended Formulations
by: Hertrich, Christoph, et al.
Published: (2024)

Price Optimal Routing in Public Transportation
by: Euler, Ricardo, et al.
Published: (2022)

Arithmetic Circuits and Neural Networks for Regular Matroids
by: Hertrich, Christoph, et al.
Published: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)