Pages that link to "Item:Q4868265"
From MaRDI portal
The following pages link to Algorithmic Chernoff-Hoeffding inequalities in integer programming (Q4868265):
Displaying 9 items.
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers (Q2576276) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)