Polynomial Time and Parameterized Approximation Algorithms for Boxicity

DOI10.1007/978-3-642-33293-7_14zbMath1335.68294arXiv1201.5958OpenAlexW90899801MaRDI QIDQ4899248

Jasine Babu, Abhijin Adiga, L. Sunil Chandran

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmboxicityparameterized algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Structural parameterizations for boxicity ⋮ Parameterized analysis and crossing minimization problems ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ Sublinear approximation algorithms for boxicity and related problems

This page was built for publication: Polynomial Time and Parameterized Approximation Algorithms for Boxicity