首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
Authors:Jrgen Bang-Jensen  Daniel Gonalves  Inge Li Grtz
Institution:

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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号