On the public citation graph

A new delay‐constrained algorithm for multicast routing tree construction

https://doi.org/10.1002/dac.685
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/978-0-387-34949-7_3openalex-snapshot
Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks
inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1007/bf01294129openalex-snapshot
Balancing minimum spanning trees and shortest-path trees
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s005300050075openalex-snapshot
The multimedia multicasting problem
inferredcites →https://doi.org/10.1016/s0304-3975(02)00613-8openalex-snapshot
Improved shortest path algorithms for nearly acyclic graphs
inferredcites →https://doi.org/10.1109/43.137519openalex-snapshot
Provably good performance-driven global routing
inferredcites →https://doi.org/10.1109/49.564135openalex-snapshot
Destination-driven routing for low-cost multicast
inferredcites →https://doi.org/10.1109/65.819168openalex-snapshot
Multicast routing and its QoS extension: problems, algorithms, and protocols
inferredcites →https://doi.org/10.1109/glocom.1995.502623openalex-snapshot
Localized multicast routing
inferredcites →https://doi.org/10.1109/iscas.1993.394112openalex-snapshot
A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing
inferredcites →https://doi.org/10.1109/jcn.2000.6596737openalex-snapshot
QDMR: An efficient QoS dependent multicast routing algorithm
inferredcites →https://doi.org/10.1109/tnet.2002.804832openalex-snapshot
Adaptive proportional routing: a localized QoS routing approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.3084openalex-snapshot
Multicast routing based on data envelopment analysis with multiple Quality of Service parameters
inferred← citeshttps://doi.org/10.1007/s00779-011-0370-8openalex-snapshot
A new scalable multicast routing algorithm for interactive real-time applications
inferred← citeshttps://doi.org/10.1109/ccdc49329.2020.9164550openalex-snapshot
A Comparative Study of Multicast Routing minimizing bandwidth under delay constraint for Smart Grids Communication
inferred← citeshttps://doi.org/10.1109/icwus.2010.5670444openalex-snapshot
A new multicast routing algorithm with cost, delay and delay-variation constraints
inferred← citeshttps://doi.org/10.1109/lcn.2009.5355090openalex-snapshot
A novel extension of Kruskal's algorithm in multicast routing
inferred← citeshttps://doi.org/10.1109/lcn.2010.5735701openalex-snapshot
Strategies and approaches for multicast tree stability
inferred← citeshttps://doi.org/10.1109/wiopt.2007.4480041openalex-snapshot
Delay Constrained Minimum Power Broadcasting in Wireless Networks
inferred← citeshttps://doi.org/10.1109/wmnc.2011.6097252openalex-snapshot
Qos routing mechanisms for multicast tree stability
inferred← citeshttps://doi.org/10.1142/9781860947308_0025openalex-snapshot
MINIMUM POWER MULTICASTING WITH DELAY BOUND CONSTRAINTS IN AD HOC WIRELESS NETWORKS
inferred← citeshttps://doi.org/10.20944/preprints201907.0316.v1openalex-snapshot
A Real-time Geo-Resilience Support Paradigm for Regional Infrastructure Sustainability using Synthetic DADO Machine Architecture
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2011.00925openalex-snapshot
Delay-constrained multicast routing algorithm based on optimized path selection
inferred← citeshttps://doi.org/10.4018/978-1-4666-2026-1.ch015openalex-snapshot
New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing
inferred← citeshttps://doi.org/10.4018/jbdcn.2011100103openalex-snapshot
New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.152-154.1834openalex-snapshot
A Delay-Constrained Multicast Routing Balanced-Optimization Algorithm of Link-Sharing
inferred← citeshttps://doi.org/10.6119/jmst-013-1119-2openalex-snapshot
A Particle Swarm Optimization-Like Algorithm for Constrained Minimal Spanning Tree Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.