Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs |
scientific article |
Statements
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (English)
0 references
14 May 2008
0 references
edge-disjoint spanning trees
0 references
approximation algorithm
0 references
graphic matroid
0 references
transversal matroid
0 references
matroid partition algorithm
0 references
approximation scheme
0 references
