Pages that link to "Item:Q3603455"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for the Spanning Star Forest Problem (Q3603455):
Displayed 10 items.
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Approximation algorithms for the maximum carpool matching problem (Q2399375) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)