Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6063381 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum spanning tree problem | |||
| Property / zbMATH Keywords: minimum spanning tree problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial time approximation schemes | |||
| Property / zbMATH Keywords: polynomial time approximation schemes / rank | |||
Normal rank | |||
Revision as of 02:29, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time approximation schemes for the constrained minimum spanning tree problem |
scientific article |
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
