Unbiased Matrix Rounding

DOI10.1016/j.endm.2007.01.007zbMath1293.65076arXivcs/0604068OpenAlexW2123230678MaRDI QIDQ3439563

Ralf Osbild, Benjamin Doerr, Tobias Friedrich, Christian Klein

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0604068

zbMATH Keywords

approximation algorithmroundinglinear discrepancycontrolled roundingrounding matrices

Mathematics Subject Classification ID

Roundoff error (65G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global roundings of sequences
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• The maximum deviation just-in-time scheduling problem.
• Elements of statistical disclosure control
• Linear discrepancy of totally unimodular matrices
• A Constructive Procedure for Unbiased Controlled Rounding
• Controlled Rounding
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Degree-Constrained Network Spanners with Nonconstant Delay
• Matrix Rounding Problems
• Approximation and Online Algorithms

This page was built for publication: Unbiased Matrix Rounding