Degree-Constrained Network Spanners with Nonconstant Delay

From MaRDI portal



Abstract: Given n real numbers 0leqx1,...,xn<1 and a permutation~sigma of 1,...,n, we can always find xbar1,...,xbarnin0,1 so that the partial sums xbar1+...+xbark and xbarsigma1+...+xbarsigmak differ from the unrounded values x1+...+xk and xsigma1+...+xsigmak by at most n/(n+1), for 1leqkleqn. The latter bound is best possible. The proof uses an elementary argument about flows in a certain network, and leads to a simple algorithm that finds an optimum way to round.












This page was built for publication: Degree-Constrained Network Spanners with Nonconstant Delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837654)