Pages that link to "Item:Q2921450"

The following pages link to Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees (Q2921450):

Displaying 8 items.

• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
• An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
• A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
• A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← 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)