Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
Optimal long code test with one free bit
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.
citing papers explorer
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
-
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.