Pages that link to "Item:Q2350897"
From MaRDI portal
The following pages link to Better approximation algorithms for the maximum internal spanning tree problem (Q2350897):
Displayed 9 items.
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- On residual approximation in solution extension problems (Q1631675) (← 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)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)