Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
The rectilinear Steiner arborescence problem is NP-complete.
Weiping Shi
,
Chen Su
Venue
A*
SODA
Year
2000
Proceedings
SODA
DBLP record
conf/soda/ShiS00 ↗
Browse the full
SODA paper archive
.