Pages that link to "Item:Q2922649"
From MaRDI portal
The following pages link to Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649):
Displaying 8 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- Budgeted colored matching problems (Q1742233) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- (Q6065436) (← links)