Cover Image

Alphabet Reduction for Reconfiguration Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ohsaka, Naoto
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Discrete Mathematics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
by: Hirahara, Shuichi, et al.
Published: (2023)

On Approximate Reconfigurability of Label Cover
by: Ohsaka, Naoto
Published: (2023)

Tight Inapproximability of Target Set Reconfiguration
by: Ohsaka, Naoto
Published: (2024)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
by: Hirahara, Shuichi, et al.
Published: (2024)

Asymptotically Optimal Inapproximability of Maxmin $k$-Cut Reconfiguration
by: Hirahara, Shuichi, et al.
Published: (2024)

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
by: Hirahara, Shuichi, et al.
Published: (2025)

On the Parameterized Intractability of Determinant Maximization
by: Ohsaka, Naoto
Published: (2022)

Gap Preserving Reductions Between Reconfiguration Problems
by: Ohsaka, Naoto
Published: (2022)

Gap Amplification for Reconfiguration Problems
by: Ohsaka, Naoto
Published: (2023)

The Days On Days Off Scheduling Problem
by: Nießen, Fabien, et al.
Published: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
by: DeHaan, Ian, et al.
Published: (2025)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
by: Foucaud, Florent, et al.
Published: (2023)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
by: Kratochvíl, Jan, et al.
Published: (2020)

Graph Search Trees and the Intermezzo Problem
by: Beisegel, Jesse, et al.
Published: (2024)

Space Efficient Algorithms for Parameterised Problems
by: Akhtar, Sheikh Shakil, et al.
Published: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
by: Haviv, Ishay
Published: (2022)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
by: Scheffler, Robert
Published: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
by: Bonomo-Braberman, Flavia, et al.
Published: (2020)

Counting Locally Optimal Tours in the TSP
by: Manthey, Bodo, et al.
Published: (2024)

Relative-error monotonicity testing
by: Chen, Xi, et al.
Published: (2024)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
by: Lill, Jonas, et al.
Published: (2024)

Channel allocation revisited through 1-extendability of graphs
by: Busson, Anthony, et al.
Published: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
by: Hsieh, Sun-Yuan, et al.
Published: (2024)

Fractional Linear Matroid Matching is in quasi-NC
by: Gurjar, Rohit, et al.
Published: (2024)

A Dichotomy for Maximum PCSPs on Graphs
by: Nakajima, Tamio-Vesa, et al.
Published: (2024)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
by: Bengali, Vedangi, et al.
Published: (2024)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)

The periodic structure of local consistency
by: Ciardo, Lorenzo, et al.
Published: (2024)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

A note on approximating the average degree of bounded arboricity graphs
by: Eden, Talya, et al.
Published: (2026)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
by: Fei, Yumou, et al.
Published: (2025)

Relative-error unateness testing
by: Chen, Xi, et al.
Published: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
by: Antoniadis, Antonios, et al.
Published: (2025)

Parameterised distance to local irregularity
by: Fioravantes, Foivos, et al.
Published: (2023)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
by: Shao, Shuai, et al.
Published: (2023)

Relative-error testing of conjunctions and decision lists
by: Chen, Xi, et al.
Published: (2025)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
by: Vroon, Mats, et al.
Published: (2025)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
by: Hamm, Thekla, et al.
Published: (2026)