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

DOI10.1007/S00453-004-1119-9zbMATH Open1069.68022OpenAlexW2048812285MaRDI QIDQ1763147FDOQ1763147

Authors: Guoliang Xue, Wei Xiao 

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

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• Neural and delay based heuristics for the Steiner problem in networks
• scientific article; zbMATH DE number 6264040
• Delay-constrained, low-cost multicast routing in multimedia networks
• A multicast routing algorithm based on tabu search

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)

Cited In (9)

• The subdivision-constrained routing requests problem
• A PTAS for weight constrained Steiner trees in series--parallel graphs.
• Minimum diameter cost-constrained Steiner trees
• Diameter-constrained Steiner trees
• Finding cheapest deadline paths
• SOFSEM 2005: Theory and Practice of Computer Science
• \(k\)-pair delay constrained minimum cost routing in undirected networks
• Title not available (Why is that?)
• Steiner trees with bounded RC-delay

This page was built for publication: A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763147)