Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithms for multicast connection under multi-path routing model.

From MaRDI portal
Publication:1853101
Jump to:navigation, search

DOI10.1016/S0020-0190(02)00220-XzbMath1042.68005OpenAlexW2045864518MaRDI QIDQ1853101

Xiao-Dong Hu, Jun Gu, Mu-Hong Zhang

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00220-x


zbMATH Keywords

Approximation algorithmsRouting algorithmsMulticast connectionNetwork cost


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)


Related Items (5)

Routing algorithm for multicast under multi-tree model in optical networks ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem ⋮ An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem ⋮ An improved approximation algorithm for multicast \(k\)-tree routing



Cites Work

  • Unnamed Item
  • A fast algorithm for Steiner trees
  • A Greedy Heuristic for the Set-Covering Problem
  • Routing to Multiple Destinations in Computer Networks


This page was built for publication: Algorithms for multicast connection under multi-path routing model.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853101&oldid=14237138"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki