LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs

DOI10.1007/978-3-662-44777-2_36zbMath1390.68761OpenAlexW2137552070MaRDI QIDQ2921429

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_36

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Perfect graphs (05C17)

Related Items (1)

Reconfiguration of Colorable Sets in Classes of Perfect Graphs

This page was built for publication: LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs