Hardness of approximation for crossing number
Computational Geometry
2012-04-04 v1 Computational Complexity
Combinatorics
Abstract
We show that, if P\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
Cite
@article{arxiv.1204.0660,
title = {Hardness of approximation for crossing number},
author = {Sergio Cabello},
journal= {arXiv preprint arXiv:1204.0660},
year = {2012}
}
Comments
10 pages, 4 figures