Fast approximation algorithms for computing constrained minimum spanning trees

DOI10.1007/978-3-319-71150-8_9zbMath1470.90151OpenAlexW2769236065MaRDI QIDQ1699768

Pei Yao, Longkun Guo

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_9

zbMATH Keywords

approximation algorithmFPTASbicameral edge replacementconstrained minimum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

This page was built for publication: Fast approximation algorithms for computing constrained minimum spanning trees