On the public citation graph

ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

0 signed · 90 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/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1002/net.3230190102openalex-snapshot
An SST‐based algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230220105openalex-snapshot
Steiner tree problems
inferredcites →https://doi.org/10.1007/3-540-57155-8_285openalex-snapshot
Greedy algorithms for the on-line steiner tree and generalized steiner problems
inferredcites →https://doi.org/10.1007/bf01758765openalex-snapshot
Path-distance heuristics for the Steiner problem in undirected networks
inferredcites →https://doi.org/10.1016/0166-218x(92)90021-2openalex-snapshot
Steiner's problem in graphs: heuristic methods
inferredcites →https://doi.org/10.1016/0169-7552(90)90014-jopenalex-snapshot
Graph theoretic models for multicast communications
inferredcites →https://doi.org/10.1109/49.12889openalex-snapshot
Routing of multipoint connections
inferredcites →https://doi.org/10.1109/90.490743openalex-snapshot
The PIM architecture for wide-area multicast routing
inferredcites →https://doi.org/10.1109/glocom.1995.502627openalex-snapshot
Distributed algorithms for multicast path setup in data networks
inferredcites →https://doi.org/10.1109/infcom.1992.263480openalex-snapshot
Multicasting for multimedia applications
inferredcites →https://doi.org/10.1109/infcom.1993.253246openalex-snapshot
How bad is naive multicast routing?
inferredcites →https://doi.org/10.1109/infcom.1995.515879openalex-snapshot
Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks
inferredcites →https://doi.org/10.1109/infcom.1995.515897openalex-snapshot
Degree-constrained multicasting in point-to-point networks
inferredcites →https://doi.org/10.1109/infcom.1996.497914openalex-snapshot
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
inferredcites →https://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferredcites →https://doi.org/10.1137/0404033openalex-snapshot
Dynamic Steiner Tree Problem
inferredcites →https://doi.org/10.1145/167954.166246openalex-snapshot
Core based trees (CBT)
inferredcites →https://doi.org/10.1145/78952.78953openalex-snapshot
Multicast routing in datagram internetworks and extended LANs
inferredcites →https://doi.org/10.5555/34233.34235openalex-snapshot
Steiner problem in networks: a survey

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.557openalex-snapshot
Dynamic group multicast routing with bandwidth reservations
inferred← citeshttps://doi.org/10.1002/ett.4460100304openalex-snapshot
A Self‐Adaptive Load Balanced Internet Multicast Routing Protocol
inferred← citeshttps://doi.org/10.1007/11573036_77openalex-snapshot
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_25openalex-snapshot
Optimization Problems in Multicast Tree Construction
inferred← citeshttps://doi.org/10.1007/978-0-387-35388-3_6openalex-snapshot
SELDOM: A Simple and Efficient Low-cost, Delay-bounded Online Multicasting
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_10openalex-snapshot
Steiner Tree Based Distributed Multicast Routing in Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-5713-5_3openalex-snapshot
Multicast Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-52988-8_24openalex-snapshot
A Plug-in Framework for Efficient Multicast Using SDN
inferred← citeshttps://doi.org/10.1007/978-3-540-24680-0_159openalex-snapshot
A Multicast Routing Algorithm for CSCW
inferred← citeshttps://doi.org/10.1007/978-3-540-72606-7_82openalex-snapshot
Online Multicasting in WDM Networks with Shared Light Splitter Bank
inferred← citeshttps://doi.org/10.1007/978-3-540-79549-0_19openalex-snapshot
Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast
inferred← citeshttps://doi.org/10.1007/bf03005258openalex-snapshot
GMRP: problème généralisé de routage multipoint
inferred← citeshttps://doi.org/10.1007/bf03179727openalex-snapshot
QoS multicast routing with delay constraints
inferred← citeshttps://doi.org/10.1007/bfb0000343openalex-snapshot
A distributed delay-constrained dynamic multicast routing algorithm
inferred← citeshttps://doi.org/10.1007/s11107-008-0138-xopenalex-snapshot
Online multicasting in WDM networks with shared light splitter bank
inferred← citeshttps://doi.org/10.1007/s11276-006-6254-6openalex-snapshot
Dynamic proxy tree-based data dissemination schemes for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.03.031openalex-snapshot
Proactive rearrangement in delay constrained dynamic membership multicast
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.08.005openalex-snapshot
Artificial immune based hybrid GA for QoS based multicast routing in large scale networks (AISMR)
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.09.023openalex-snapshot
A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.03.005openalex-snapshot
On-line multicast routing with QoS constraints in WDM networks with no wavelength converters
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.06.003openalex-snapshot
Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.04.020openalex-snapshot
The cost optimal solution of the multi-constrained multicast routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2003.12.007openalex-snapshot
A survey of combinatorial optimization problems in multicast routing
inferred← citeshttps://doi.org/10.1016/j.knosys.2005.10.009openalex-snapshot
An effective algorithm for delay-constrained dynamic multicasting
inferred← citeshttps://doi.org/10.1016/s0140-3664(00)00298-xopenalex-snapshot
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00195-0openalex-snapshot
A case for tree migration and integrated tree maintenance in QoS multicasting
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00239-6openalex-snapshot
Distributed multicast tree generation with dynamic group membership
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00246-3openalex-snapshot
Exploiting the temporal dimension in QoS-aware multicast routing
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00208-4openalex-snapshot
Algorithms for delay-constrained low-cost multicast tree construction
inferred← citeshttps://doi.org/10.1016/s1389-1286(03)00322-0openalex-snapshot
An efficient QoS routing algorithm for quorumcast communication
inferred← citeshttps://doi.org/10.1016/s1389-1286(99)00123-1openalex-snapshot
A flexible multicast routing protocol for group communication
inferred← citeshttps://doi.org/10.1023/a:1019180830926openalex-snapshot
A distributed delay-constrained dynamic multicast routing algorithm
inferred← citeshttps://doi.org/10.1023/a:1020503130270openalex-snapshot
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
inferred← citeshttps://doi.org/10.1109/49.564135openalex-snapshot
Destination-driven routing for low-cost multicast
inferred← citeshttps://doi.org/10.1109/49.957314openalex-snapshot
CTMS: a novel constrained tree migration scheme for multicast services in generic wireless systems
inferred← citeshttps://doi.org/10.1109/65.819168openalex-snapshot
Multicast routing and its QoS extension: problems, algorithms, and protocols
inferred← citeshttps://doi.org/10.1109/90.700892openalex-snapshot
Restricted dynamic Steiner trees for scalable multicast in datagram networks
inferred← citeshttps://doi.org/10.1109/90.793020openalex-snapshot
A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees
inferred← citeshttps://doi.org/10.1109/90.803380openalex-snapshot
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
inferred← citeshttps://doi.org/10.1109/broadnets.2007.4550475openalex-snapshot
Online broadcasting and multicasting in WDM networks with shared light splitter bank
inferred← citeshttps://doi.org/10.1109/cacwd.2004.1349147openalex-snapshot
A dynamic algorithm used in multicast routing
inferred← citeshttps://doi.org/10.1109/carpi.2012.6356327openalex-snapshot
Optimization of MAODV protocol based on dynamic partial reconstruction algorithm
inferred← citeshttps://doi.org/10.1109/glocom.2001.965928openalex-snapshot
A case for scalable multicast tree migration
inferred← citeshttps://doi.org/10.1109/icc.2002.997056openalex-snapshot
Exploiting the temporal dimension in QoS-aware multicast routing
inferred← citeshttps://doi.org/10.1109/icccn.2005.1523827openalex-snapshot
Constructing minimum cost dynamic multicast trees under delay constraint
inferred← citeshttps://doi.org/10.1109/icccn.2008.ecp.115openalex-snapshot
Proactive Rearrangement in Delay Constrained Multicast with Dynamic Membership Support
inferred← citeshttps://doi.org/10.1109/icct.1996.545227openalex-snapshot
Routing multipoint connections in VP-based ATM networks
inferred← citeshttps://doi.org/10.1109/icnp.2001.992890openalex-snapshot
An efficient QoS routing algorithm for quorumcast communication
inferred← citeshttps://doi.org/10.1109/icppw.1999.800035openalex-snapshot
Building dynamic multicast trees in mobile networks
inferred← citeshttps://doi.org/10.1109/infcom.1996.497914openalex-snapshot
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
inferred← citeshttps://doi.org/10.1109/infcom.1997.644569openalex-snapshot
Restricted dynamic Steiner trees for scalable multicast in datagram networks
inferred← citeshttps://doi.org/10.1109/infcom.1999.751662openalex-snapshot
A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees
inferred← citeshttps://doi.org/10.1109/infcom.2000.832221openalex-snapshot
QoS-based multicast routing for distributing layered video to heterogeneous receivers in rate-based networks
inferred← citeshttps://doi.org/10.1109/ipps.1998.669941openalex-snapshot
Multicasting and broadcasting in large WDM networks
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358675openalex-snapshot
An effective heuristic algorithm for dynamic multicast routing with delay-constrained
inferred← citeshttps://doi.org/10.1109/itre.2005.1503098openalex-snapshot
An efficient distributed approach for dynamic multicast trees
inferred← citeshttps://doi.org/10.1109/its.1998.718470openalex-snapshot
Efficient tree construction for the multicast problem
inferred← citeshttps://doi.org/10.1109/mahss.2004.1392064openalex-snapshot
Dynamic proxy tree-based data dissemination schemes for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/opnarc.2000.828128openalex-snapshot
Lightweight, dynamic and programmable virtual private networks
inferred← citeshttps://doi.org/10.1109/reldis.1998.740517openalex-snapshot
Distributed center location algorithm for fault-tolerant multicast in wide-area networks
inferred← citeshttps://doi.org/10.1109/tpds.2009.166openalex-snapshot
Improving Reliability for Application-Layer Multicast Overlays
inferred← citeshttps://doi.org/10.1142/s0129054102001527openalex-snapshot
THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
inferred← citeshttps://doi.org/10.1145/1671962.1671963openalex-snapshot
Enabling multi-party 3D tele-immersive environments with ViewCast
inferred← citeshttps://doi.org/10.1145/2746539.2746615openalex-snapshot
The Power of Dynamic Distance Oracles
inferred← citeshttps://doi.org/10.1145/280549.292473openalex-snapshot
Bibliography of recent publications on computer communication
inferred← citeshttps://doi.org/10.1145/984622.984645openalex-snapshot
RoamHBA
inferred← citeshttps://doi.org/10.12694/scpe.v2i3.142openalex-snapshot
Multicast in large WDM networks
inferred← citeshttps://doi.org/10.1631/jzus.2006.a0156openalex-snapshot
Effective multicasting algorithm for dynamic membership with delay constraint
inferred← citeshttps://doi.org/10.25439/rmt.27354315openalex-snapshot
Video streaming over the internet using application layer multicast
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3336openalex-snapshot
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
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.