Pages that link to "Item:Q3183476"
From MaRDI portal
The following pages link to Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476):
Displaying 12 items.
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- (Q2861557) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
