Structured randomized rounding and coloring (extended abstract)

DOI10.1007/3-540-44669-9_53MaRDI QIDQ4782741zbMATH OpenFDO

Authors Benjamin Doerr

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380461

zbMATH Keywords

discrepancyhypergraph coloringinteger linear programmingrandomized algorithmsrandomized rounding

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Non-independent randomized rounding and coloring
• Recursive randomized coloring beats fair dice random colorings
• Multi-color discrepancies
• Balanced coloring: Equally easy for all numbers of colors?
• Practical algorithms for low-discrepancy 2-colorings

Cited in

(7)

• Non-independent randomized rounding and coloring
• Randomized rounding in the presence of a cardinality constraint
• Balanced coloring: Equally easy for all numbers of colors?
• scientific article; zbMATH DE number 7368393 (Why is no real title available?)
• scientific article; zbMATH DE number 7525474 (Why is no real title available?)
• Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
• Practical algorithms for low-discrepancy 2-colorings

This page was built for publication: Structured randomized rounding and coloring (extended abstract)

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