The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used rounding methods: the quota method of greatest remainders, and the divisor meth-ods. These methods are used to round continuous non-negative weights summing to one to non-negative integers summing to a predetermined accuracy, e.g. to 100 when rounding to percentages. Our results are of interest when average properties of rounding methods are in-vestigated, and an example from political science is included
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
When factorizing binary matrices, we often have to make a choice between using expensive combinatori...
Efficient rounding of approximate designs / F. Pukelsheim ; S. Rieder. - In: Biometrika. 79. 1992. S...
AbstractThe paper determines the vertices and surface volumes of all rounding polytopes for commonly...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
This report reviews some approximation algorithms for combinatorial optimization problems, base
A detailed investigation of three different rounding rules for multiplication and division is presen...
From time to time, people dealing with accounting are faced with the following table rounding proble...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
Discretization methods to round an approximate design into an exact design for a given sample size n...
Resampling methods are widely studied and increasingly employed in applied research and practice. W...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-o...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
When factorizing binary matrices, we often have to make a choice between using expensive combinatori...
Efficient rounding of approximate designs / F. Pukelsheim ; S. Rieder. - In: Biometrika. 79. 1992. S...
AbstractThe paper determines the vertices and surface volumes of all rounding polytopes for commonly...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
This report reviews some approximation algorithms for combinatorial optimization problems, base
A detailed investigation of three different rounding rules for multiplication and division is presen...
From time to time, people dealing with accounting are faced with the following table rounding proble...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
Discretization methods to round an approximate design into an exact design for a given sample size n...
Resampling methods are widely studied and increasingly employed in applied research and practice. W...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-o...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
When factorizing binary matrices, we often have to make a choice between using expensive combinatori...
Efficient rounding of approximate designs / F. Pukelsheim ; S. Rieder. - In: Biometrika. 79. 1992. S...