Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410)

From MaRDI portal
Revision as of 04:34, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q666664)
scientific article
Language Label Description Also known as
English
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
scientific article

    Statements

    Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2015
    0 references
    independent sets
    0 references
    rectangle selection
    0 references
    duality gap
    0 references

    Identifiers