Degree-Constrained Network Spanners with Nonconstant Delay
From MaRDI portal
Abstract: Given real numbers and a permutation~ of , we can always find so that the partial sums and differ from the unrounded values and by at most , for . 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.
Recommendations
Cited in
(11)- Rounding in symmetric matrices and undirected graphs
- Recent progress on combinatorics and algorithms for low discrepancy roundings
- Unbiased Matrix Rounding
- Roundings in partially ordered topological spaces
- scientific article; zbMATH DE number 1737508 (Why is no real title available?)
- The alternating stock size problem and the gasoline puzzle
- The alternating stock size problem and the gasoline puzzle
- Innocuous Double Rounding of Basic Arithmetic Operations
- Integer matrices with constraints on leading partial row and column sums
- Embedding multidimensional grids into optimal hypercubes
- Global roundings of sequences
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)