论文信息 - Approximating optimum branchings in linear time - 字舞流文

Approximating optimum branchings in linear time

We prove that maximum weight branchings in directed graphs can be approximated in time O(m) up to a factor of [email protected], where @e>0 is an arbitrary constant.

Valentin Ziegler | Valentin Ziegler

[1] Benjamin Avi-Itzhak,et al. Developments in Operations Research , 1971 .

[2] Fritz Bock. An algorithm to construct a minimum directed spanning tree in a directed network , 1971 .

[3] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[4] Torsten Suel,et al. Approximate maximum weight branchings , 2006, Inf. Process. Lett..

[5] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.

[6] Richard M. Karp,et al. A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.