The structure and number of global roundings of a graph

DOI10.1016/j.tcs.2004.02.044zbMath1057.05060OpenAlexW1543818728MaRDI QIDQ1884844

Hisao Tamaki, Takeshi Tokuyama, Tetsuo Asano, Naoki Katoh

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.044

zbMATH Keywords

CombinatoricsDiscrepancyGraphHypergraphRounding

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65)

Related Items (1)

Recent progress on combinatorics and algorithms for low discrepancy roundings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
• Tight upper bounds for the discrepancy of half-spaces
• Algorithms and Computation

This page was built for publication: The structure and number of global roundings of a graph