Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning

DOI10.1137/S0097539702417511zbMath1030.68064OpenAlexW2045397582MaRDI QIDQ4429695

Naoki Katoh, Koji Obokata, Takeshi Tokuyama, Tetsuo Asano

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702417511

zbMATH Keywords

linear programmingapproximation algorithmdiscrepancynetwork flowdigital halftoningtotally unimodularmatrix rounding

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Linear programming (90C05) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (9)

Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Recent progress on combinatorics and algorithms for low discrepancy roundings ⋮ \(L_{p}\) linear discrepancy of totally unimodular matrices ⋮ Matrix approximation and Tusnády's problem ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ Randomized Rounding in the Presence of a Cardinality Constraint

This page was built for publication: Matrix Rounding under the L_p-Discrepancy Measure and Its Application to Digital Halftoning