Author:
Kerivin Hervé,Zhao Jinhua
Funder
National Natural Science Foundation of China
Subject
Applied Mathematics,Computational Mathematics
Reference26 articles.
1. Improved approximations for the steiner tree problem;Berman;J. Algorithms,1994
2. Polyhedral study of the connected subgraph problem;Biha;Discrete Math.,2015
3. Minimum-weight degree-constrained spanning tree problem: heuristics and implementation on an SIMD parallel machine;Boldon;Parallel Comput.,1996
4. A branch and cut method for the degree-constrained minimum spanning tree problem;Caccetta;Netw. Int. J.,2001
5. A note on the data-driven capacity of p2p networks;Chakareski,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded-degree rooted tree and TDI-ness;RAIRO - Operations Research;2022-07