Abstract
We study the maximum subforest problem: Given a tree G and a set of trees H, find a subgraph G′ of G such that G′ does not contain a subtree isomorphic to a tree from H, and the number of edges in G′ is maximum. We give a polynomial time approximation scheme for this problem. We also give an exact algorithm for this problem whose time complexity is 2O(k(2)/log k)n, where n is the number of vertices in G, and k is the total number of vertices in H.
| Original language | English |
|---|---|
| Pages | 394-399 |
| Number of pages | 6 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 25 Jan 1998 → 27 Jan 1998 |
Conference
| Conference | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 25/01/98 → 27/01/98 |