Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IPCO
/
Paper
A nearly best-possible approximation algorithm for node-weighted Steiner trees.
Philip N. Klein
,
R. Ravi
Venue
B
IPCO
Year
1993
Proceedings
IPCO
DBLP record
conf/ipco/KleinR93a ↗
Browse the full
IPCO paper archive
.