Hardness of approximation for crossing number

Details Hardness of approximation for crossing number Hardness of approximation for crossing number

2012-04-03

arxiv.org/abs/1204.0660v1

Computer Science

Computational Geometry

10 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hardness of approximation for crossing number does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hardness of approximation for crossing number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardness of approximation for crossing number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354937