6 papers:
CASE-2015-LiangSQLY #agile #assessment #development #using- Criteria for lean practice selection: Development an assessment tool using the rooted arborescence (YL, SS, LQ, YL, GY), pp. 237–242.
ICALP-v2-2015-KantorK #problem- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (EK, SK), pp. 675–687.
- ICALP-v2-2014-KantorK #problem #symmetry
- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (EK, SK), pp. 520–531.
STOC-2009-BateniCG #bound- MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.
SAC-2004-JulstromA #algorithm #hybrid #problem- Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
- STOC-1991-Gabow #approach
- A Matroid Approach to Finding Edge Connectivity and Packing Arborescences (HNG), pp. 112–122.
