Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987)
From MaRDI portal
scientific article; zbMATH DE number 6610477
- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems |
scientific article; zbMATH DE number 6610477 |
|
Statements
Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (English)
0 references
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems (English)
0 references
26 October 2018
0 references
10 August 2016
0 references
min-cost chain-constrained spanning-tree
0 references
Lagrangian duality
0 references
0 references
0 references
