Pages that link to "Item:Q1606980"
From MaRDI portal
The following pages link to A matched approximation bound for the sum of a greedy coloring (Q1606980):
Displaying 4 items.
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)
- (Q4411283) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)