ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥3p\geq 3 and k≥1k\geq 1 be integers. For a digraph DD, let sinv⁡k≤p(D)\operatorname{sinv}_{k}^{\leq p}(D) denote the optimization problem of making DD kk-arc-strong using inversions of size at most pp.

Bounded-size inversion approximation hardness conjecture. There exists ε>0\varepsilon>0 such that, unless P=NPP=NP, for every p≥3p\geq 3 and every k≥1k\geq 1, no polynomial-time (1+ε)(1+\varepsilon)-approximation algorithm for sinv⁡k≤p\operatorname{sinv}_{k}^{\leq p} in digraphs exists.

The conjecture asserts that increasing the allowed inversion size does not make the approximation problem easier. It is presented as an open conjecture in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.