Approximation of the Degree-Constrained Minimum Spanning Hierarchies

DOI10.1007/978-3-319-09620-9_9zbMath1416.68139OpenAlexW1569529368MaRDI QIDQ5496151

Sylvain Durand, Massinissa Merabet, Miklos Molnar

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01056259/file/s_molnar_19_01056259_app%20%281%29.pdf

zbMATH Keywords

approximationnetworksgraph theorydegree-constrained spanning problemspanning hierarchy

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

ILP formulation of the degree-constrained minimum spanning hierarchy problem ⋮ k-Trails: Recognition, Complexity, and Approximations ⋮ \(k\)-trails: recognition, complexity, and approximations

This page was built for publication: Approximation of the Degree-Constrained Minimum Spanning Hierarchies