Steiner trees in uniformly quasi-bipartite graphs. (Q1853068)
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: Steiner trees in uniformly quasi-bipartite graphs. |
scientific article; zbMATH DE number 1856409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steiner trees in uniformly quasi-bipartite graphs. |
scientific article; zbMATH DE number 1856409 |
Statements
Steiner trees in uniformly quasi-bipartite graphs. (English)
0 references
21 January 2003
0 references
Analysis of algorithms
0 references
Approximation algorithms
0 references
Network design
0 references
Steiner tree problem in graphs
0 references
0.9056222
0 references
0 references
0.8926556
0 references
0.8921529
0 references
0.8908315
0 references
0.8902899
0 references
0.8896209
0 references
0.8875121
0 references
