ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Hardness of approximation for crossing number
    Cabello, Sergio
    We show that, if P▫$\ne$▫NP, there is a constant ▫$c_0 > 1$▫ such that there is no ▫$c_0$▫-approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
    Source: Discrete & computational geometry. - ISSN 0179-5376 (Vol. 49, iss. 2, 2013, str. 348-358)
    Type of material - article, component part
    Publish date - 2013
    Language - english
    COBISS.SI-ID - 16340313