Improved Inapproximability of Rainbow Coloring

DOI10.1137/1.9781611975994.90MaRDI QIDQ5146867zbMATH OpenOpenAlexFDO

Authors Per Austrin, Amey Bhangale, Aditya Potukuchi

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.02784

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(12)

• Beyond PCSP (\textbf{1-in-3}, \textbf{NAE})
• Inapproximability of Rainbow Colouring
• Rainbow coloring hardness via low sensitivity polymorphisms
• Rainbow Coloring Hardness via Low Sensitivity Polymorphisms
• CLAP: A New Algorithm for Promise CSPs
• Topology and Adjunction in Promise Constraint Satisfaction
• SDPs and robust satisfiability of promise CSP
• The complexity of promise SAT on non-Boolean domains
• Linearly ordered colourings of hypergraphs
• Beyond PCSP (1-in-3, NAE)
• Maximum bipartite vs. triangle-free subgraph
• Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings

This page was built for publication: Improved Inapproximability of Rainbow Coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146867)