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 algorithmgraph algorithmpartitionsubtree cover problemtraveling salesman problem
 Summary | Full Text:PDF