Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910)
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 6063381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time approximation schemes for the constrained minimum spanning tree problem |
scientific article; zbMATH DE number 6063381 |
Statements
Polynomial time approximation schemes for the constrained minimum spanning tree problem (English)
0 references
6 August 2012
0 references
Summary: Let \(G = (V, E)\) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree \(T\) in \(G\) such that the total weight in \(T\) is at most a given bound \(B\). In this paper, we present two polynomial time approximation schemes for the constrained minimum spanning tree problem.
0 references
minimum spanning tree problem
0 references
polynomial time approximation schemes
0 references
0 references
0.8918944597244263
0 references
0.8583406805992126
0 references
0.8160510063171387
0 references
0.8010855317115784
0 references
0.8007781505584717
0 references
