VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • 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.
    Vir: Discrete & computational geometry. - ISSN 0179-5376 (Vol. 49, iss. 2, 2013, str. 348-358)
    Vrsta gradiva - članek, sestavni del
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16340313