Degree-Constrained Network Spanners with Nonconstant Delay
From MaRDI portal
Publication:4837654
DOI10.1137/S0895480193251635zbMath0828.90110arXivmath/9504228OpenAlexW2007264759MaRDI QIDQ4837654
Publication date: 3 July 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9504228
Permutations, words, matrices (05A05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (5)
Recent progress on combinatorics and algorithms for low discrepancy roundings ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Rounding in symmetric matrices and undirected graphs ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ Unbiased Matrix Rounding
This page was built for publication: Degree-Constrained Network Spanners with Nonconstant Delay