Designing Steiner networks with unicyclic connected components: an easy problem (Q3013146)
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 5924693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Designing Steiner networks with unicyclic connected components: an easy problem |
scientific article; zbMATH DE number 5924693 |
Statements
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem (English)
0 references
18 July 2011
0 references
combinatorial optimization
0 references
network design
0 references
matching
0 references
polyhedral study
0 references
unicyclic graphs
0 references
matroids
0 references
Steiner networks
0 references
0.9752718806266784
0 references
0.8260228037834167
0 references
0.7843350768089294
0 references
0.7810871005058289
0 references
0.7810869812965393
0 references
