Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982)
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: Simpler analysis of LP extreme points for traveling salesman and survivable network design problems |
scientific article; zbMATH DE number 5718118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simpler analysis of LP extreme points for traveling salesman and survivable network design problems |
scientific article; zbMATH DE number 5718118 |
Statements
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (English)
0 references
8 June 2010
0 references
linear programming relaxations
0 references
traveling salesman
0 references
survivable network design
0 references
approximation algorithms
0 references
0 references
0 references
0.8810502
0 references
0.8612385
0 references
0.85380995
0 references
0.8480511
0 references
0.84783554
0 references
