A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property

Documenti analoghi

• Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)
  di: Istrate, Gabriel
  Pubblicazione: (2024)
• Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
  di: Grüne, Christoph, et al.
  Pubblicazione: (2023)
• A Decomposition Approach to the Weighted $k$-server Problem
  di: Ayyadevara, Nikhil, et al.
  Pubblicazione: (2024)
• On Minimum Maximal Distance-k Matchings
  di: Kartynnik, Yury, et al.
  Pubblicazione: (2016)
• NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
  di: Fairbairn, David L., et al.
  Pubblicazione: (2024)