Fast approximation algorithms for computing constrained minimum spanning trees (Q1699768)
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 6843479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for computing constrained minimum spanning trees |
scientific article; zbMATH DE number 6843479 |
Statements
Fast approximation algorithms for computing constrained minimum spanning trees (English)
0 references
26 February 2018
0 references
constrained minimum spanning tree
0 references
bicameral edge replacement
0 references
approximation algorithm
0 references
FPTAS
0 references
0.9063963890075684
0 references
0.8807533979415894
0 references
0.8577519059181213
0 references
0.8363597989082336
0 references
0.8160510063171387
0 references
