Inapproximability of hypergraph vertex cover and applications to scheduling problems

N. Bansal, S. Khot

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    66 Citations (Scopus)

    Fingerprint

    Dive into the research topics of 'Inapproximability of hypergraph vertex cover and applications to scheduling problems'. Together they form a unique fingerprint.

    Mathematics