The minimum conflict-free row split problem revisited

DOI10.1007/978-3-319-68705-6_23zbMath1483.05182OpenAlexW2765433062MaRDI QIDQ1687927

Martin Milanič, Edin Husić, Romeo Rizzi, Ademir Hujdurović, Alexandru I. Tomescu

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68705-6_23

zbMATH Keywords

approximation algorithmbranchingAPX-hardnessDilworth's theoremMIN-MAX theoremminimum conflict-free row split problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: The minimum conflict-free row split problem revisited