Balancing Degree, Diameter, and Weight in Euclidean Spanners
From MaRDI portal
Publication:2935264
DOI10.1137/120901295zbMath1305.05048arXiv1108.6022MaRDI QIDQ2935264
Publication date: 22 December 2014
Published in: SIAM Journal on Discrete Mathematics, Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.6022
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68P05: Data structures