
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.
10 pages, 4 figures
Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC)
Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 18 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
