Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974): Difference between revisions
From MaRDI portal
Latest revision as of 01:15, 16 July 2024
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
0 references