Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles (Q5405052)
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: Improved minmax regret 1-center algorithms for cactus networks with c cycles |
scientific article; zbMATH DE number 6276019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles |
scientific article; zbMATH DE number 6276019 |
Statements
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles (English)
0 references
31 March 2014
0 references
0.9521604180336
0 references
0.8748797178268433
0 references
0.8598611354827881
0 references
0.858001172542572
0 references
0.846671462059021
0 references
