Neural and delay based heuristics for the Steiner problem in networks
DOI10.1016/S0377-2217(97)00369-XzbMATH Open0957.90025WikidataQ126436855 ScholiaQ126436855MaRDI QIDQ1296029FDOQ1296029
Authors: Anoop Ghanwani 
Publication date: 1 April 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
- scientific article; zbMATH DE number 1304096
- A multicast routing algorithm based on tabu search
- SOFSEM 2005: Theory and Practice of Computer Science
- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
optimizationneural networksSteiner treesATM networksmultipoint routingconstrained Steiner treesmulticase communicationrandom neural network model
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15)
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Steiner tree problem
- Steiner Minimal Trees
- Finding the K Shortest Loopless Paths in a Network
- Routing to Multiple Destinations in Computer Networks
- Algorithms for finding paths with multiple constraints
- The Complexity of Computing Steiner Minimal Trees
- A fast algorithm for Steiner trees
- The steiner problem in graphs
- Steiner's problem in graphs and its implications
- The computation of nearly minimal Steiner trees in graphs
- Title not available (Why is that?)
- Heuristics for the Steiner problem in graphs
- A practical version of Lee's multicast switch architecture
- Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
Cited In (7)
- A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
- A branch-and-cut algorithm for the Steiner tree problem with delays
- \(G\)-networks: A versatile approach for work removal in queueing networks
- A multicast routing algorithm based on tabu search
- Title not available (Why is that?)
- Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
- SOFSEM 2005: Theory and Practice of Computer Science
This page was built for publication: Neural and delay based heuristics for the Steiner problem in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296029)
