Pages that link to "Item:Q3186517"
From MaRDI portal
The following pages link to Approximation-Friendly Discrepancy Rounding (Q3186517):
Displaying 4 items.
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- (Q4604370) (redirect page) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
