Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
Hiroshi Nagamochi
,
Kohei Okada
Venue
B
ISAAC
Year
2003
Proceedings
ISAAC
DBLP record
conf/isaac/NagamochiO03 ↗
Browse the full
ISAAC paper archive
.