|
|||||
|
|
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs |
|
| Authors: | J rgen Bang-Jensen, Daniel Gon alves,Inge Li G rtz |
| Affiliation: | aDepartment of Mathematics and Computer Science, University of Southern Denmark, DK-5230 Odense, Denmark bLIRMM, 161 rue Ada, F-34392 Montpellier Cedex, France cDepartment of Informatics and Mathematical Modeling, The Technical University of Denmark, DK 2800 Lyngby, Denmark |
| Abstract: | |
| Keywords: | Edge-disjoint spanning trees Approximation algorithm Graphic matroid Transversal matroid Matroid partition algorithm Approximation scheme |
| 本文献已被 ScienceDirect 等数据库收录！ | |