Title of article
Approximating the minmax rooted-tree cover in a tree
Author/Authors
Hiroshi Nagamochi، نويسنده , , Kohei Okada، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
6
From page
173
To page
178
Keywords
graph algorithms , Design of algorithms , Tree covers , approximation algorithms , Combinatorial problems , Tree partitioning
Journal title
Information Processing Letters
Serial Year
2007
Journal title
Information Processing Letters
Record number
130510
Link To Document