Minimum cost perfect matching with delays for two sources (Q1628601)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum cost perfect matching with delays for two sources |
scientific article; zbMATH DE number 6988755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost perfect matching with delays for two sources |
scientific article; zbMATH DE number 6988755 |
Statements
Minimum cost perfect matching with delays for two sources (English)
0 references
4 December 2018
0 references
online algorithms
0 references
min-cost perfect matching with delays
0 references
two sources
0 references
competitive analysis
0 references
0 references
0.9177028
0 references
0.9177028
0 references
0.91264117
0 references
0.86634207
0 references
0.83794683
0 references
0.82871854
0 references
0 references
0.81813896
0 references
