Efficient algorithms for the prize collecting Steiner tree problems with interval data (Q3578355)
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: Efficient algorithms for the prize collecting Steiner tree problems with interval data |
scientific article; zbMATH DE number 5758179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the prize collecting Steiner tree problems with interval data |
scientific article; zbMATH DE number 5758179 |
Statements
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data (English)
0 references
20 July 2010
0 references
prize collecting Steiner tree
0 references
interval data
0 references
2-trees
0 references
0.9585638642311096
0 references
0.8558052778244019
0 references
0.8022070527076721
0 references
0.8000160455703735
0 references
