Practical algorithms for low-discrepancy 2-colorings

DOI10.1007/978-3-319-04696-9_7MaRDI QIDQ5264197zbMATH OpenOpenAlexFDO

Authors Lasse Kliemann

Publication date 24 July 2015

Published in A Panorama of Discrepancy Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04696-9_7

zbMATH Keywords

hypergraph of arithmetic progressions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Arithmetic progressions (11B25) Irregularities of distribution, discrepancy (11K38)

Recommendations

• scientific article; zbMATH DE number 2086378
• scientific article; zbMATH DE number 1839472
• Multi-color discrepancies
• Non-independent randomized rounding and coloring
• Deterministic discrepancy minimization

Cited in

(2)

• scientific article; zbMATH DE number 1839472 (Why is no real title available?)
• scientific article; zbMATH DE number 2119715 (Why is no real title available?)

This page was built for publication: Practical algorithms for low-discrepancy 2-colorings

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