The non-approximability of bicriteria network design problems (Q1827279)
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: The non-approximability of bicriteria network design problems |
scientific article; zbMATH DE number 2082308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The non-approximability of bicriteria network design problems |
scientific article; zbMATH DE number 2082308 |
Statements
The non-approximability of bicriteria network design problems (English)
0 references
6 August 2004
0 references
Bicriteria problems
0 references
Diameter
0 references
Network design
0 references
NP-hardness
0 references
Non-approximability
0 references
Root stretch factor
0 references
Spanning tree
0 references
Stretch factor
0 references
0 references
0 references
0 references
0.8863978
0 references
0.88527846
0 references
0 references
0.87858886
0 references
0.87858886
0 references
0.8763714
0 references
