Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660)

From MaRDI portal
Revision as of 22:32, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exact and approximation algorithms for geometric and capacitated set cover problems
scientific article

    Statements

    Exact and approximation algorithms for geometric and capacitated set cover problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    set cover
    0 references
    geometric set cover
    0 references
    capacitated set cover
    0 references
    assignment of directional antenna
    0 references
    shipping with deadlines
    0 references
    approximation algorithms
    0 references
    polynomial-time approximation scheme
    0 references
    APX-hardness
    0 references
    exact algorithms
    0 references
    time complexity
    0 references
    0 references