Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 56

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 192

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 202

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 296

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 315
IEICE Trans

Keyword : subtree cover problem

Approximating the Minmax Rooted-Subtree Cover Problem
Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A  No. 5 ; pp. 1335-1338
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
approximation algorithm, graph algorithm, partition, subtree cover problem, traveling salesman problem, 
 Summary | Full Text:PDF