A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology

DOI10.1007/s00453-004-1119-9zbMath1069.68022OpenAlexW2048812285MaRDI QIDQ1763147

Wei Xiao, Guoliang Xue

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1119-9

zbMATH Keywords

Fully polynomial time approximation schemeQuality of serviceComputer communicationsMinimum cost delay-constrained network under a Steiner topology

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

DIAMETER-CONSTRAINED STEINER TREES, A PTAS for weight constrained Steiner trees in series--parallel graphs., Finding cheapest deadline paths, Minimum diameter cost-constrained Steiner trees, The subdivision-constrained routing requests problem