AbstractThe paper determines the vertices and surface volumes of all rounding polytopes for commonly used rounding methods: the quota method of greatest remainders, and the divisor methods. 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 investigated, and an example from political science is included
Exact implementations of algorithms of computational geometry are subject to exponential growth in r...
Discretization methods to round an approximate design into an exact design for a given sample size n...
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-o...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
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...
This report reviews some approximation algorithms for combinatorial optimization problems, base
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
From time to time, people dealing with accounting are faced with the following table rounding proble...
AbstractRobustness problems due to the substitution of the exact computation on real numbers by the ...
A detailed investigation of three different rounding rules for multiplication and division is presen...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
We present a general framework for approximating several NP-hard problems that have two underlying p...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
Exact implementations of algorithms of computational geometry are subject to exponential growth in r...
Discretization methods to round an approximate design into an exact design for a given sample size n...
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-o...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
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...
This report reviews some approximation algorithms for combinatorial optimization problems, base
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
From time to time, people dealing with accounting are faced with the following table rounding proble...
AbstractRobustness problems due to the substitution of the exact computation on real numbers by the ...
A detailed investigation of three different rounding rules for multiplication and division is presen...
Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publicatio...
We present a general framework for approximating several NP-hard problems that have two underlying p...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
Exact implementations of algorithms of computational geometry are subject to exponential growth in r...
Discretization methods to round an approximate design into an exact design for a given sample size n...
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-o...