Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

MAXIMUM SUBFOREST

• INSTANCE: Tree $G=\left(V,E\right)$ and a set of trees H.
• SOLUTION: A subset $E'\subseteq E$ such that the subgraph $G'=\left(V,E'\right)$ does not contain any subtree isomorphic to a tree from H.
• MEASURE: Cardinality of the subgraph, i.e., $\vert E'\vert$.

  
  

• Good News: Admits a PTAS [438].