Recent progress on combinatorics and algorithms for low discrepancy roundings

DOI10.1007/S00373-007-0700-9MaRDI QIDQ2373430zbMATH OpenOpenAlexFDO

Authors Takeshi Tokuyama

Publication date 19 July 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0700-9

zbMATH Keywords

AlgorithmDiscrepancyGraphHypergraphMatrixRounding

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 1754592
• Combinatorics and algorithms for low-discrepancy roundings of a real sequence
• scientific article; zbMATH DE number 1947049
• Roundings respecting hard constraints

Cites work

• Algorithm Theory - SWAT 2004
• Algorithms and Computation
• Combinatorics and algorithms for low-discrepancy roundings of a real sequence
• Degree-Constrained Network Spanners with Nonconstant Delay
• Global roundings of sequences
• scientific article; zbMATH DE number 2081027 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 863495 (Why is no real title available?)
• scientific article; zbMATH DE number 6472647 (Why is no real title available?)
• scientific article; zbMATH DE number 3185974 (Why is no real title available?)
• Lattice approximation and linear discrepancy of totally unimodular matrices. Extended abstract
• Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning
• Matrix rounding with low error in small submatrices
• Nonindependent Randomized Rounding and an Application to Digital Halftoning
• On the discrepancy of 3 permutations
• Optimal roundings of sequences and matrices
• Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
• The structure and number of global roundings of a graph

Cited in

(6)

• Combinatorics and algorithms for low-discrepancy roundings of a real sequence
• The structure and number of global roundings of a graph
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Roundings respecting hard constraints
• scientific article; zbMATH DE number 1754592 (Why is no real title available?)
• Algorithm Theory - SWAT 2004

This page was built for publication: Recent progress on combinatorics and algorithms for low discrepancy roundings

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