Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974)

From MaRDI portal
Revision as of 01:15, 16 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
Costly circuits, submodular schedules and approximate Carathéodory theorems
scientific article

    Statements

    Costly circuits, submodular schedules and approximate Carathéodory theorems (English)
    0 references
    29 June 2018
    0 references
    data center networks
    0 references
    bridges and switches
    0 references
    circuit networks
    0 references
    network flows
    0 references
    submodular optimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references