| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10347618 | Computers & Operations Research | 2012 | 10 Pages |
Abstract
⺠Introducing node capacities to a spanning arborescence packing problem on digraphs. ⺠Generating in-trees by the column generation method. ⺠Solving the minimum weight rooted arborescence problem as the pricing problem. ⺠Packing in-trees by a greedy algorithm with efficient data structures. ⺠The approximation guarantee of LP-based algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura,