Pages that link to "Item:Q2392922"
From MaRDI portal
The following pages link to Improved approximation algorithms for the spanning star forest problem (Q2392922):
Displaying 8 items.
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Extended spanning star forest problems (Q1699782) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- (Q5111744) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)