A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
From MaRDI portal
Publication:5199227
DOI10.1007/978-3-642-22300-6_2zbMath1342.68353arXiv1102.1544OpenAlexW1960400727MaRDI QIDQ5199227
L. Sunil Chandran, Jasine Babu, Abhijin Adiga
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1544
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number ⋮ Lower bounds for boxicity