scientific article; zbMATH DE number 852056

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T" /><27::AID-RSA2>3.0.CO;2-T 10.1002/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-TzbMath0845.68061MaRDI QIDQ4868265

Peter Stangier, Anand Srivastav

Publication date: 15 September 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Chernoff-Hoeffding boundsSpencer's derandomization method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (8)

Tight approximations for resource constrained scheduling and bin packing ⋮ Chromatic index of dense quasirandom graphs ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ Improved approximation algorithms for the Min-Max selecting items problem ⋮ On complexity, representation and approximation of integral multicommodity flows ⋮ Algorithmic construction of low-discrepancy point sets via dependent randomized rounding ⋮ Inapproximability of b-Matching in k-Uniform Hypergraphs ⋮ Bounds and constructions for the star-discrepancy via \(\delta\)-covers

This page was built for publication: