Stackelberg network pricing is hard to approximate (Q3082599)
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 5866465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stackelberg network pricing is hard to approximate |
scientific article; zbMATH DE number 5866465 |
Statements
Stackelberg network pricing is hard to approximate (English)
0 references
16 March 2011
0 references
combinatorial optimization
0 references
APX-hardness
0 references
network pricing
0 references
Stackelberg games
0 references
0.9033363461494446
0 references
0.8661994338035583
0 references
0.8385298252105713
0 references
0.8378278017044067
0 references
0.837524950504303
0 references
