A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252040 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 2-approximation algorithm for finding a spanning tree with maximum number of leaves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing full spanning trees for cubic graphs / rank | |||
Normal rank | |||
Latest revision as of 11:05, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 3-approximation algorithm for the maximum leaf \(k\)-forest problem |
scientific article |
Statements
A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (English)
0 references
9 April 2018
0 references
approximation algorithms
0 references
maximum leaf spanning tree
0 references
\(k\)-forest
0 references
0 references
