Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474)

From MaRDI portal
Revision as of 20:43, 25 June 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
Faster and simpler approximation algorithms for mixed packing and covering problems
scientific article

    Statements

    Faster and simpler approximation algorithms for mixed packing and covering problems (English)
    0 references
    0 references
    0 references
    6 June 2007
    0 references
    0 references
    approximation algorithm
    0 references
    linear and convex programming
    0 references
    optimization
    0 references
    packing and covering problem
    0 references
    Lagrangian decomposition
    0 references
    logarithmic potential
    0 references
    0 references