Rounding of sequences and matrices, with applications

Authors:
Benjamin Doerr;Tobias Friedrich;Christian Klein;Ralf Osbild
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Year:
2005

Citing 11
Cited 2

Introduction to algorithms

Introduction to algorithms
Level schedules for mixed-model, Just-in-Time processes

Management Science
Two-Way Rounding

SIAM Journal on Discrete Mathematics
Discrepancy theory

Handbook of combinatorics (vol. 2)
Lattice approximation and linear discrepency of totally unimodular matrices

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Programming pearls: algorithm design techniques

Communications of the ACM
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The maximum deviation just-in-time scheduling problem

Discrete Applied Mathematics
Multicolour Discrepancies

Combinatorics, Probability and Computing
Global roundings of sequences

Information Processing Letters
Discrepancy-based digital halftoning: automatic evaluation and optimization

Proceedings of the 11th international conference on Theoretical foundations of computer vision

Matrix approximation and Tusnády's problem

European Journal of Combinatorics
Unbiased matrix rounding

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all column sums as well as all sums of consecutive row entries are less than two.Such roundings can be computed in linear time. This extends and improves previous results on rounding sequences and matrices in several directions. It has particular applications in just-in-time scheduling, where balanced schedules on machines with negligible switch over costs are sought after. Here we extend existing results to multiple machines and non-constant production rates.