Pages that link to "Item:Q2656175"

The following pages link to A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175):

Displaying 11 items.

• Approximating the maximum internal spanning tree problem (Q1034535) (← links)
• An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
• A linear vertex kernel for maximum internal spanning tree (Q1936242) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
• Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
• A survey on algorithms for the maximum internal spanning tree and related problems (Q2861557) (← links)
• A Linear Vertex Kernel for Maximum Internal Spanning Tree (Q3652213) (← links)