scientific article; zbMATH DE number 852056

DOI10.1002/(SICI)1098-2418(199601)8:1%3C27::AID-RSA2%3E3.0.CO;2-TMaRDI QIDQ4868265zbMATH OpenFDO

Authors Anand Srivastav, Peter Stangier

Publication date 15 September 1996

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199601)8:1%3C27::AID-RSA2%3E3.0.CO;2-T

zbMATH Keywords

Chernoff-Hoeffding boundsSpencer's derandomization method

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• scientific article; zbMATH DE number 437558
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Improved Approximation Guarantees for Packing and Covering Integer Programs

Cited in

(9)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868265)