Pages that link to "Item:Q3182915"
From MaRDI portal
The following pages link to An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915):
Displayed 16 items.
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- (Q5111744) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)