Approximate separable multichoice optimization over monotone systems (Q2673246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7538836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate separable multichoice optimization over monotone systems |
scientific article; zbMATH DE number 7538836 |
Statements
Approximate separable multichoice optimization over monotone systems (English)
0 references
9 June 2022
0 references
combinatorial optimization
0 references
load balancing
0 references
congestion routing
0 references
independence system
0 references
matching
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.89290905
0 references
0.88938725
0 references
0.8831902
0 references
0.8723669
0 references
0.8703921
0 references
0.86889315
0 references
0.8685838
0 references
0.8683293
0 references
