On the public citation graph
Steiner tree problems
0 signed · 851 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.
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.
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.1967.tb04250.xopenalex-snapshot
Minimum cost communication networks
inferredcites →https://doi.org/10.1002/net.3230010203openalex-snapshot
Steiner's problem in graphs and its implications
inferredcites →https://doi.org/10.1002/net.3230070104openalex-snapshot
Rectilinear steiner trees: Efficient special‐case algorithms
inferredcites →https://doi.org/10.1002/net.3230080104openalex-snapshot
Cost allocation for steiner trees
inferredcites →https://doi.org/10.1002/net.3230090103openalex-snapshot
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
inferredcites →https://doi.org/10.1002/net.3230100207openalex-snapshot
An integer linear programming approach to the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230110104openalex-snapshot
An O( n log n ) heuristic for steiner minimal tree problems on the euclidean metric
inferredcites →https://doi.org/10.1002/net.3230120309openalex-snapshot
An algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230140112openalex-snapshot
An algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230150109openalex-snapshot
Steiner trees, connected domination and strongly chordal graphs
inferredcites →https://doi.org/10.1002/net.3230150305openalex-snapshot
An algorithm for the steiner problem in the euclidean plane
inferredcites →https://doi.org/10.1002/net.3230150307openalex-snapshot
The Gilbert and Pollak conjecture—a generalization
inferredcites →https://doi.org/10.1002/net.3230150403openalex-snapshot
Probabilistic partitioning algorithms for the rectilinear steiner problem
inferredcites →https://doi.org/10.1002/net.3230160105openalex-snapshot
On a conjecture of trietsch and handler on the flow‐dependent steiner ratio
inferredcites →https://doi.org/10.1002/net.3230160209openalex-snapshot
Network decomposition for the optimization of connection structures
inferredcites →https://doi.org/10.1002/net.3230170102openalex-snapshot
The node‐weighted steiner tree problem
inferredcites →https://doi.org/10.1002/net.3230170107openalex-snapshot
Problem reduction methods and a tree generation algorithm for the steiner network problem
inferredcites →https://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1002/net.3230170309openalex-snapshot
Some generalizations of the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230180108openalex-snapshot
Convexity and the Steiner tree problem
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.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
inferredcites →https://doi.org/10.1002/net.3230190506openalex-snapshot
Reduction tests for the steiner problem in grapsh
inferredcites →https://doi.org/10.1002/net.3230190705openalex-snapshot
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
inferredcites →https://doi.org/10.1002/net.3230200110openalex-snapshot
Faster exact algorithms for steiner trees in planar networks
inferredcites →https://doi.org/10.1002/net.3230200407openalex-snapshot
Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
inferredcites →https://doi.org/10.1002/sapm1973522141openalex-snapshot
A Conjecture of Gilbert and Pollak on Minimal Trees
inferredcites →https://doi.org/10.1007/3-540-17218-1_46openalex-snapshot
On approximation algorithms for Steiner's problem in graphs
inferredcites →https://doi.org/10.1007/3-540-18088-5openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/3-540-18099-0_44openalex-snapshot
Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-50728-0openalex-snapshot
Graph-Theoretic Concepts in Computer Science
inferredcites →https://doi.org/10.1007/3-540-50728-0_32openalex-snapshot
NC-algorithms for graphs with small treewidth
inferredcites →https://doi.org/10.1007/978-1-4613-2555-0openalex-snapshot
An Artificial Intelligence Approach to VLSI Routing
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-0348-5936-3_6openalex-snapshot
Some experiments with Steiner trees
inferredcites →https://doi.org/10.1007/bf00149359openalex-snapshot
On Steiner trees for bounded point sets
inferredcites →https://doi.org/10.1007/bf00264613openalex-snapshot
On efficient implementation of an approximation algorithm for the Steiner tree problem
inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1007/bf00289500openalex-snapshot
A faster approximation algorithm for the Steiner problem in graphs
inferredcites →https://doi.org/10.1007/bf01078826openalex-snapshot
Subclass of the Steiner problems on a plane with rectilinear metric
inferredcites →https://doi.org/10.1007/bf01553886openalex-snapshot
Fast heuristic algorithms for rectilinear steiner trees
inferredcites →https://doi.org/10.1007/bf01582166openalex-snapshot
Convergence of an annealing algorithm
inferredcites →https://doi.org/10.1007/bf01681346openalex-snapshot
Locating the vertices of a steiner tree in an arbitrary metric space
inferredcites →https://doi.org/10.1007/bf01732471openalex-snapshot
Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
inferredcites →https://doi.org/10.1007/bf01758756openalex-snapshot
How to find Steiner minimal trees in euclideand-space
inferredcites →https://doi.org/10.1007/bf01758759openalex-snapshot
Improved computation of plane Steiner Minimal Trees
inferredcites →https://doi.org/10.1007/bf01758762openalex-snapshot
The rectilinear steiner arborescence problem
inferredcites →https://doi.org/10.1007/bf01762114openalex-snapshot
Two probabilistic results on rectilinear steiner trees
inferredcites →https://doi.org/10.1007/bf01840379openalex-snapshot
On the complexity of embedding planar graphs to minimize certain distance measures
inferredcites →https://doi.org/10.1007/bf01840406openalex-snapshot
Comments on Bern's probabilistic results on rectilinear Steiner trees
inferredcites →https://doi.org/10.1007/bf01935369openalex-snapshot
Generalized steiner problem in outerplanar networks
inferredcites →https://doi.org/10.1007/bf01949715openalex-snapshot
Cost-minimal trees in directed acyclic graphs
inferredcites →https://doi.org/10.1007/bf01952728openalex-snapshot
THE ROLE OF TOPOLOGY AND GEOMETRY IN OPTIMAL NETWORK DESIGN
inferredcites →https://doi.org/10.1007/bf02007669openalex-snapshot
Steiner minimal trees for bar waves
inferredcites →https://doi.org/10.1007/bf02067240openalex-snapshot
The role of Steiner hulls in the solution to Steiner tree problems
inferredcites →https://doi.org/10.1007/bf02067241openalex-snapshot
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
inferredcites →https://doi.org/10.1007/bf02071979openalex-snapshot
Polynomially solvable special cases of the Steiner problem in planar networks
inferredcites →https://doi.org/10.1007/bf02071982openalex-snapshot
The multi-weighted Steiner tree problem
inferredcites →https://doi.org/10.1007/bf02071983openalex-snapshot
An approach for the Steiner problem in directed graphs
inferredcites →https://doi.org/10.1007/bf02187871openalex-snapshot
Steiner minimal trees for regular polygons
inferredcites →https://doi.org/10.1007/bf02187892openalex-snapshot
Steiner minimal trees on sets of four points
inferredcites →https://doi.org/10.1007/bf02187919openalex-snapshot
A decomposition theorem on Euclidean Steiner minimal trees
inferredcites →https://doi.org/10.1007/bf02458863openalex-snapshot
Computational complexity of inferring phylogenies from dissimilarity matrices
inferredcites →https://doi.org/10.1007/bf02574675openalex-snapshot
Analytic formulas for full steiner trees
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1007/bfb0016276openalex-snapshot
Near optimal algorithms for finding minimum Steiner trees on random graphs
inferredcites →https://doi.org/10.1007/bfb0017148openalex-snapshot
The steiner tree problem and homogeneous sets
inferredcites →https://doi.org/10.1007/s00122-008-0801-8openalex-snapshot
A natural mutation in rc reverts white-rice-pericarp to red and results in a new, dominant, wild-type allele: Rc-g
inferredcites →https://doi.org/10.1016/0012-365x(83)90179-6openalex-snapshot
A class of full Steiner minimal trees
inferredcites →https://doi.org/10.1016/0012-365x(86)90040-3openalex-snapshot
Hexagonal coordinate systems and steiner minimal trees
inferredcites →https://doi.org/10.1016/0012-365x(90)90359-popenalex-snapshot
Permutation graphs: Connected domination and Steiner trees
inferredcites →https://doi.org/10.1016/0020-0190(86)90062-1openalex-snapshot
Exact computation of Steiner minimal trees in the plane
inferredcites →https://doi.org/10.1016/0020-0190(88)90066-xopenalex-snapshot
A faster approximation algorithm for the Steiner problem in graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90225-6openalex-snapshot
Worst-case performance of Rayward-Smith's Steiner tree heuristic
inferredcites →https://doi.org/10.1016/0020-0190(89)90039-2openalex-snapshot
The Steiner problem with edge lengths 1 and 2
inferredcites →https://doi.org/10.1016/0020-0190(89)90216-0openalex-snapshot
A fast algorithm for constructing trees from distance matrices
inferredcites →https://doi.org/10.1016/0022-0000(86)90018-8openalex-snapshot
Chordality properties on graphs and minimal conceptual connections in semantic data models
inferredcites →https://doi.org/10.1016/0022-5193(73)90252-xopenalex-snapshot
A method for constructing maximum parsimony ancestral amino acid sequences on a given network
inferredcites →https://doi.org/10.1016/0022-5193(83)90296-5openalex-snapshot
Computationally difficult parsimony problems in phylogenetic systematics
inferredcites →https://doi.org/10.1016/0025-5564(68)90043-6openalex-snapshot
Clustering in numerical cladistics: A minimum-length directed tree problem
inferredcites →https://doi.org/10.1016/0025-5564(82)90027-xopenalex-snapshot
Branch and bound algorithms to determine minimal evolutionary trees
inferredcites →https://doi.org/10.1016/0025-5564(82)90125-0openalex-snapshot
Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
inferredcites →https://doi.org/10.1016/0025-5564(86)90161-6openalex-snapshot
The computational complexity of inferring rooted phylogenies by parsimony
inferredcites →https://doi.org/10.1016/0026-2714(83)91008-9openalex-snapshot
Steiner trees in probabilistic networks
inferredcites →https://doi.org/10.1016/0038-0121(82)90017-9openalex-snapshot
Steiner minimal trees and urban service networks
inferredcites →https://doi.org/10.1016/0095-8956(84)90067-4openalex-snapshot
On the length of optimal TSP circuits in sets of bounded diameter
inferredcites →https://doi.org/10.1016/0097-3165(78)90058-4openalex-snapshot
Some remarks on the Steiner problem
inferredcites →https://doi.org/10.1016/0097-3165(82)90056-5openalex-snapshot
A short proof of a result of Pollak on Steiner minimal trees
inferredcites →https://doi.org/10.1016/0097-3165(85)90073-1openalex-snapshot
The steiner ratio conjecture is true for five points
inferredcites →https://doi.org/10.1016/0166-218x(86)90048-xopenalex-snapshot
Testing the theory of evolution: A novel application of comibinatorial optimization
inferredcites →https://doi.org/10.1016/0166-218x(87)90021-7openalex-snapshot
The telephonic switching centre network problem: formalization and computational experience
inferredcites →https://doi.org/10.1016/0166-218x(87)90031-xopenalex-snapshot
Steiner problem in Halin networks
inferredcites →https://doi.org/10.1016/0167-6377(86)90008-8openalex-snapshot
A linear time algorithm for full steiner trees
inferredcites →https://doi.org/10.1016/0167-6377(88)90058-2openalex-snapshot
On the convex hull of the union of certain polyhedra
inferredcites →https://doi.org/10.1016/0167-6377(89)90005-9openalex-snapshot
An edge elimination test for the steiner problem in graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90018-0openalex-snapshot
Generalized steiner problem in series-parallel networks
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(87)90021-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(87)90032-0openalex-snapshot
The 1-steiner tree problem
inferredcites →https://doi.org/10.1016/0307-904x(80)90163-8openalex-snapshot
An O (n2) heuristic algorithm for the directed Steiner minimal tree problem
inferredcites →https://doi.org/10.1016/0377-2217(81)90203-4openalex-snapshot
Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle
inferredcites →https://doi.org/10.1016/0377-2217(89)90170-7openalex-snapshot
Reducing the hierarchical network design problem
inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50026-5openalex-snapshot
Dynamic Search in Graphs
inferredcites →https://doi.org/10.1016/s0022-5193(84)80103-4openalex-snapshot
Maximum savings in the Steiner problem in phylogeny
inferredcites →https://doi.org/10.1016/s0022-5193(87)80263-1openalex-snapshot
Computational complexity of inferring phylogenies from chromosome inversion data
inferredcites →https://doi.org/10.1016/s0092-8240(87)80007-1openalex-snapshot
Computational complexity of inferring phylogenies from dissimilarity matrices
inferredcites →https://doi.org/10.1016/s0167-5060(08)70332-7openalex-snapshot
Steiner Trees for Ladders
inferredcites →https://doi.org/10.1016/s0196-8858(82)80004-3openalex-snapshot
The steiner problem in phylogeny is NP-complete
inferredcites →https://doi.org/10.1016/s0304-0208(08)73236-5openalex-snapshot
The Steiner Problem in Graphs
inferredcites →https://doi.org/10.1017/9781316276259.010openalex-snapshot
Phylogenetic analysis: models and estimation procedures
inferredcites →https://doi.org/10.1017/s0305004100034095openalex-snapshot
The shortest path through many points
inferredcites →https://doi.org/10.1038/scientificamerican0189-84openalex-snapshot
The Shortest-Network Problem
inferredcites →https://doi.org/10.1051/ro/1978120202071openalex-snapshot
Une heuristique pour le problème de l'arbre de Steiner
inferredcites →https://doi.org/10.1057/jors.1979.240openalex-snapshot
Optimal Design of Gas Pipeline Networks
inferredcites →https://doi.org/10.1080/0020739830140103openalex-snapshot
The computation of nearly minimal Steiner trees in graphs
inferredcites →https://doi.org/10.1080/0025570x.1969.11975961openalex-snapshot
Euclidean Constructibility in Graph-Minimization Problems
inferredcites →https://doi.org/10.1080/0025570x.1989.11977416openalex-snapshot
Steiner Trees on a Checkerboard
inferredcites →https://doi.org/10.1080/01468037808240539openalex-snapshot
Application of the steiner street problem to a more economical data bus
inferredcites →https://doi.org/10.1080/03052157908902401openalex-snapshot
STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
inferredcites →https://doi.org/10.1080/03052158008902421openalex-snapshot
AN 0 (N log N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEM
inferredcites →https://doi.org/10.1080/03052158308960625openalex-snapshot
STEINER PROBLEMS IN GRAPHS: ALGORITHMS AND APPLICATIONS
inferredcites →https://doi.org/10.1080/03155986.1990.11732136openalex-snapshot
Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
inferredcites →https://doi.org/10.1080/03155986.1990.11732138openalex-snapshot
Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
inferredcites →https://doi.org/10.1086/283157openalex-snapshot
On the Problem of Discovering the Most Parsimonious Tree
inferredcites →https://doi.org/10.1086/412935openalex-snapshot
Numerical Methods for Inferring Evolutionary Trees
inferredcites →https://doi.org/10.1088/0031-9120/16/1/005openalex-snapshot
Communication networks, soap films and vectors
inferredcites →https://doi.org/10.1090/qam/233286openalex-snapshot
Steiner’s problem for set-terminals
inferredcites →https://doi.org/10.1090/qam/448883openalex-snapshot
Polyconics. I. Polyellipses and optimization
inferredcites →https://doi.org/10.1090/s0002-9939-1985-0810173-6openalex-snapshot
Steiner Minimal Tree for Points on a Circle
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0697065-3openalex-snapshot
A New Bound for the Steiner Ratio
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0697066-5openalex-snapshot
Steiner Minimal Trees on Zig-Zag Lines
inferredcites →https://doi.org/10.1093/bioinformatics/3.3.183openalex-snapshot
Turbo Tree: a fast algorithm for minimal trees
inferredcites →https://doi.org/10.1093/biomet/72.1.191openalex-snapshot
Applications of the Annealing Algorithm to Combinatorial Problems in Statistics
inferredcites →https://doi.org/10.1093/nar/10.1.421openalex-snapshot
A strategy for sequence phylogeny research
inferredcites →https://doi.org/10.1093/nar/12.14.5837openalex-snapshot
On the evolutionary descent of organisms and organelles: a global phylogeny based on a highly conserved structural core in small subunit ribosomal RNA
inferredcites →https://doi.org/10.1093/oso/9780195105193.001.0001openalex-snapshot
What Is Mathematics?
inferredcites →https://doi.org/10.1093/sysbio/19.1.83openalex-snapshot
Methods for Computing Wagner Trees
inferredcites →https://doi.org/10.1093/sysbio/20.4.406openalex-snapshot
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
inferredcites →https://doi.org/10.1093/sysbio/33.1.52openalex-snapshot
Deriving Phylogenetic Trees from Allele Frequencies
inferredcites →https://doi.org/10.1093/sysbio/35.2.224openalex-snapshot
Computational Complexity of Inferring Phylogenies by Compatibility
inferredcites →https://doi.org/10.1109/43.45871openalex-snapshot
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle
inferredcites →https://doi.org/10.1109/dac.1986.1586145openalex-snapshot
A New Routing Algorithm and Its Hardware Implementation
inferredcites →https://doi.org/10.1109/dac.1986.1586159openalex-snapshot
A Language for Describing Rectilinear Steiner Tree Configurations.
inferredcites →https://doi.org/10.1109/dac.1986.1586184openalex-snapshot
Algorithms for Global Routing
inferredcites →https://doi.org/10.1109/iccad.1988.122489openalex-snapshot
A new global router for row-based layout
inferredcites →https://doi.org/10.1109/iccad.1989.76892openalex-snapshot
A powerful global router: based on Steiner min-max trees
inferredcites →https://doi.org/10.1109/iccad.1989.76893openalex-snapshot
Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree
inferredcites →https://doi.org/10.1109/icpr.1990.119382openalex-snapshot
Parallel heuristics for the Steiner tree problem in images without sorting or routing
inferredcites →https://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferredcites →https://doi.org/10.1109/tcs.1976.1084243openalex-snapshot
Use of Steiner's problem in suboptimal routing in rectilinear metric
inferredcites →https://doi.org/10.1109/tcs.1979.1084551openalex-snapshot
An O(n log n) algorithm for suboptimal rectilinear Steiner trees
inferredcites →https://doi.org/10.1109/tct.1972.1083408openalex-snapshot
A Counterexample to a Theorem of Fu on Steiner's Problem
inferredcites →https://doi.org/10.1109/tct.1972.1083538openalex-snapshot
Suboptimal algorithm for a wire routing problem
inferredcites →https://doi.org/10.1109/tct.1973.1083680openalex-snapshot
On a multinet wiring problem
inferredcites →https://doi.org/10.1111/j.1469-1809.1973.tb00595.xopenalex-snapshot
The method of minimum evolution
inferredcites →https://doi.org/10.1111/j.1541-0064.1969.tb00493.xopenalex-snapshot
Networks of Minimum Length
inferredcites →https://doi.org/10.1111/j.1558-5646.1965.tb01722.xopenalex-snapshot
A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
inferredcites →https://doi.org/10.1111/j.1749-6632.1985.tb14564.xopenalex-snapshot
A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES
inferredcites →https://doi.org/10.1112/s0025579300000784openalex-snapshot
The shortest path and the shortest road through n points
inferredcites →https://doi.org/10.1137/0114025openalex-snapshot
On Steiner’s Problem with Rectilinear Distance
inferredcites →https://doi.org/10.1137/0118014openalex-snapshot
On the Efficiency of the Algorithm for Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0129048openalex-snapshot
On Minimum Cost Networks with Nonlinear Costs
inferredcites →https://doi.org/10.1137/0130013openalex-snapshot
On Steiner Minimal Trees with Rectilinear Distance
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0132072openalex-snapshot
The Complexity of Computing Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0134003openalex-snapshot
A Lower Bound for the Steiner Tree Problem
inferredcites →https://doi.org/10.1137/0134020openalex-snapshot
A Note on Minimum Cost Networks with Nonlinear Costs
inferredcites →https://doi.org/10.1137/0145051openalex-snapshot
Augmenting Euclidean Networks—the Steiner Case
inferredcites →https://doi.org/10.1137/0149057openalex-snapshot
A Simple Proof of the Steiner Ratio Conjecture for Five Points
inferredcites →https://doi.org/10.1137/0150015openalex-snapshot
An Improved Algorithm for Steiner Trees
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0217004openalex-snapshot
On the Complexity of Covering Vertices by Faces in a Planar Graph
inferredcites →https://doi.org/10.1137/0217032openalex-snapshot
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
inferredcites →https://doi.org/10.1137/0217057openalex-snapshot
An Approximation Scheme for Finding Steiner Trees with Obstacles
inferredcites →https://doi.org/10.1137/0601010openalex-snapshot
Rectilinear Steiner Trees in Rectangle Trees
inferredcites →https://doi.org/10.1145/1216969.1216975openalex-snapshot
Set of test problems for the minimum length connection networks
inferredcites →https://doi.org/10.1145/1217082.1217084openalex-snapshot
Minimum Steiner trees, roots of a polynomial, and other magic
inferredcites →https://doi.org/10.1145/1270.1275openalex-snapshot
Resolving the query inference problem using Steiner trees
inferredcites →https://doi.org/10.1145/321724.321733openalex-snapshot
The Generation of Minimal Trees with a Steiner Topology
inferredcites →https://doi.org/10.1145/322123.322124openalex-snapshot
An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1145/355759.355764openalex-snapshot
An Improved Program for the Full Steiner Tree Problem
inferredcites →https://doi.org/10.1145/74382.74410openalex-snapshot
A new approach to the rectilinear Steiner tree problem
inferredcites →https://doi.org/10.1145/98524.98596openalex-snapshot
On minimal rectilinear Steiner trees in all dimensions
inferredcites →https://doi.org/10.1146/annurev.ge.22.120188.002513openalex-snapshot
PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITY
showing the first 200 of 224 · page through all 224
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199801)31:1<39::aid-net5>3.0.co;2-lopenalex-snapshot
A branch and cut algorithm for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-oopenalex-snapshot
Solving Steiner tree problems in graphs to optimality
inferred← citeshttps://doi.org/10.1002/1520-6424(200102)84:2<18::aid-ecja3>3.0.co;2-dopenalex-snapshot
Network design and control for multipoint-to-multipoint communications
inferred← citeshttps://doi.org/10.1002/adma.201605223openalex-snapshot
Swarm Intelligence‐Inspired Spontaneous Fabrication of Optimal Interconnect at the Micro/Nanoscale
inferred← citeshttps://doi.org/10.1002/advs.202100141openalex-snapshot
Neuron‐Inspired Steiner Tree Networks for 3D Low‐Density Metastructures
inferred← citeshttps://doi.org/10.1002/cpe.3466openalex-snapshot
An improved EDA for solving Steiner tree problem
inferred← citeshttps://doi.org/10.1002/cpe.5266openalex-snapshot
Cost‐efficient disaster backup for multiple data centers using capacity‐constrained multicast
inferred← citeshttps://doi.org/10.1002/cpe.6795openalex-snapshot
Intra‐cluster aggregation aware routing for distributed training in wireless sensor networks
inferred← citeshttps://doi.org/10.1002/dac.469openalex-snapshot
An integrated routing and admission control mechanism for real‐time multicast connection establishment
inferred← citeshttps://doi.org/10.1002/dac.859openalex-snapshot
A scalable multicast routing protocol for building shortest path trees
inferred← citeshttps://doi.org/10.1002/ett.4460100208openalex-snapshot
Optimal Routing for Dynamic Multipoint Connection
inferred← citeshttps://doi.org/10.1002/nem.485openalex-snapshot
A dynamic multicast routing satisfying multiple QoS constraints
inferred← citeshttps://doi.org/10.1002/net.22005openalex-snapshot
Solving Steiner trees: Recent advances, challenges, and perspectives
inferred← citeshttps://doi.org/10.1002/net.3230240404openalex-snapshot
A delaunay triangulation‐based heuristic for the euclidean steiner problem
inferred← citeshttps://doi.org/10.1002/net.3230250206openalex-snapshot
Thirty‐five‐point rectilinear steiner minimal trees in a day
inferred← citeshttps://doi.org/10.1002/net.3230260411openalex-snapshot
An O(N2) heuristic for steiner minimal trees in E3
inferred← citeshttps://doi.org/10.1002/sat.70086openalex-snapshot
Routing and Downlink Resource Allocation for Multicast Traffic in LEO Satellite Constellations
inferred← citeshttps://doi.org/10.1002/wcm.795openalex-snapshot
Placing and maintaining a core node in wirelessad hocnetworks
inferred← citeshttps://doi.org/10.1006/jcss.1997.1513openalex-snapshot
The Steiner Tree Problem in Orientation Metrics
inferred← citeshttps://doi.org/10.1006/jcta.1996.0040openalex-snapshot
Disproofs of Generalized Gilbert–Pollak Conjecture on the Steiner Ratio in Three or More Dimensions
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_2openalex-snapshot
The Steiner Ratio of Banach-Minkowski spaces - A Survey
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_2openalex-snapshot
Continuous Approaches for Solving Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/11549468_67openalex-snapshot
A Dynamic Distributed Algorithm for Multicast Path Setup
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/11833529_38openalex-snapshot
A New QoS Multicast Routing Model and Its Immune Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/11847366_46openalex-snapshot
On Multicasting Steiner Trees for Delay and Delay Variation Constraints
inferred← citeshttps://doi.org/10.1007/3-540-32394-5_7openalex-snapshot
Semantic Distances for Sets of Senses and Applications in Word Sense Disambiguation
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_83openalex-snapshot
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
inferred← citeshttps://doi.org/10.1007/3-540-45551-5_12openalex-snapshot
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_102openalex-snapshot
On Multicasting with Minimum Costs for the Internet Topology
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_206openalex-snapshot
An approximation scheme for some Steiner tree problems in the plane
inferred← citeshttps://doi.org/10.1007/3-540-58483-8_11openalex-snapshot
A unified paradigm for parallel Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_134openalex-snapshot
O(n log n)-average-time algorithm for shortest network under a given topology
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_135openalex-snapshot
Steiner problems on directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_18openalex-snapshot
Steiner Tree Problems in Telecommunications
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-30165-5_31openalex-snapshot
Optimization in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-36721-7_10openalex-snapshot
Global Optimization of Network Length and Simulation of Film Evolution
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_31openalex-snapshot
Bayesian Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_53openalex-snapshot
Steiner Minimum Trees in E3: Theory, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_56openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-1-4471-2155-8_30openalex-snapshot
Performance Improvement of an Optical Network Providing Services Based on Multicast
inferred← citeshttps://doi.org/10.1007/978-1-4471-5298-9_3openalex-snapshot
How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_2openalex-snapshot
Genetic Algorithm Approaches to Solve Various Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_3openalex-snapshot
Neural Network Approaches to Solve Various Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_13openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_17openalex-snapshot
Steiner Minimal Trees in E 3: Theory, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_8openalex-snapshot
On Shortest K-Edge Connected Steiner Networks with Rectilinear Distance
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_10openalex-snapshot
Optimization Problems in Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_8openalex-snapshot
The Steiner Ratio of L p -planes
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_2openalex-snapshot
The Steiner Ratio of L p -planes
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_4openalex-snapshot
Computing Shortest Networks with Fixed Topologies
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_8openalex-snapshot
Exact Steiner Trees in Graphs and Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_9openalex-snapshot
Grade of Service Steiner Trees in Series-Parallel Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-16469-0_2openalex-snapshot
Optimizing Costs and Quality of Interior Lighting by Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-23281-8_11openalex-snapshot
A Keyword Search Approach for Semantic Web Data
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_645-1openalex-snapshot
Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-57602-8_5openalex-snapshot
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane $$\mathbb {R}^2$$
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_19openalex-snapshot
Quantum Speedup for the Minimum Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-01866-4openalex-snapshot
Data Exploration Using Example-Based Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-13074-8_11openalex-snapshot
Reinforcement Learning for Routing
inferred← citeshttps://doi.org/10.1007/978-3-031-24848-1_5openalex-snapshot
Ordered Scheduling in Control-Flow Distributed Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-27041-3_16openalex-snapshot
Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-33455-9_12openalex-snapshot
iSummary: Workload-Based, Personalized Summaries for Knowledge Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_11openalex-snapshot
A New Approach for Approximating Directed Rooted Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-09527-5_13openalex-snapshot
A Domain-Independent Approach for Semantic Table Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-319-08840-2_8openalex-snapshot
SFB-ACO for Submicron VLSI Routing Optimization with Timing Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-11857-4_47openalex-snapshot
A Multi-objective Jumping Particle Swarm Optimization Algorithm for the Multicast Routing
inferred← citeshttps://doi.org/10.1007/978-3-319-41009-8_34openalex-snapshot
MISTER: An Approximate Minimum Steiner Tree Based Routing Scheme in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_63openalex-snapshot
An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49715-0_14openalex-snapshot
Time-of-Flight Calculation in Complex Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-67988-4_90openalex-snapshot
Optimal External Support Structure Design in Additive Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-540-24679-4_83openalex-snapshot
A Multicast Routing Algorithm for P2P Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30189-9_9openalex-snapshot
Minimum-Cost Multicast Routing for Multi-layered Multimedia Distribution
inferred← citeshttps://doi.org/10.1007/978-3-540-30573-6_38openalex-snapshot
Unicast and Multicast QoS Routing with Multiple Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-30582-8_27openalex-snapshot
A Minimum Cost Multicast Routing Algorithm with the Consideration of Dynamic User Membership
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_48openalex-snapshot
QoS-Driven Multicast Tree Generation Using Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-72606-7_2openalex-snapshot
Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-87989-3_6openalex-snapshot
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-01399-7_67openalex-snapshot
Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_4openalex-snapshot
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_6openalex-snapshot
Pin Assignment Using Stochastic Local Search Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-11169-3_2openalex-snapshot
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-14355-7_3openalex-snapshot
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
inferred← citeshttps://doi.org/10.1007/978-3-642-23756-0_5openalex-snapshot
An Approximate Algorithm Application to Solve the Location-Selection of Wireless Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25349-2_109openalex-snapshot
An Approximate Algorithm to Solve the Location-Selection of Wireless Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_6openalex-snapshot
Contraction-Based Steiner Tree Approximations in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-29157-9_34openalex-snapshot
FOMR: Fair Opportunistic Multicast Routing Scheme for Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_38openalex-snapshot
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_24openalex-snapshot
Unexplored Steiner Ratios in Geometric Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-37487-6_35openalex-snapshot
Efficient Querying of Correlated Uncertain Data with Cached Results
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_14openalex-snapshot
Genetic Algorithms for Dynamic Routing Problems in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39640-3_45openalex-snapshot
An Effective Keyword Search Method for Graph-Structured Data Using Extended Answer Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_57openalex-snapshot
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_11openalex-snapshot
Two Special Cases for Rectilinear Steiner Minimum Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-78910-6_160openalex-snapshot
Steiner Tree Heuristics — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_44openalex-snapshot
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_54openalex-snapshot
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
inferred← citeshttps://doi.org/10.1007/978-981-92-0366-6_21openalex-snapshot
SP-GCRL: Influence Maximization on Incomplete Social Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-6035-6_12openalex-snapshot
Artificial Intelligence Application for Multi-objective Optimization
inferred← citeshttps://doi.org/10.1007/978-981-96-1490-5_6openalex-snapshot
1-Line Minimum $$\lambda $$-Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_6openalex-snapshot
Fully Dynamic Algorithms for Euclidean Steiner Tree
inferred← citeshttps://doi.org/10.1007/978-981-97-2253-2_25openalex-snapshot
Query-Decision Regression Between Shortest Path and Minimum Steiner Tree
inferred← citeshttps://doi.org/10.1007/bf00203241openalex-snapshot
A neural network for the Steiner minimal tree problem
inferred← citeshttps://doi.org/10.1007/bf00248006openalex-snapshot
A heuristic for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1007/bf01104898openalex-snapshot
A heuristic for piping residential sprinklers
inferred← citeshttps://doi.org/10.1007/bf01188713openalex-snapshot
Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
inferred← citeshttps://doi.org/10.1007/bf01415533openalex-snapshot
An integer programming formulation of the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1007/bf01758756openalex-snapshot
How to find Steiner minimal trees in euclideand-space
inferred← citeshttps://doi.org/10.1007/bf01758761openalex-snapshot
A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets
inferred← citeshttps://doi.org/10.1007/bf01758763openalex-snapshot
Two new criteria for finding Steiner hulls in Steiner tree problems
inferred← citeshttps://doi.org/10.1007/bf01955679openalex-snapshot
Approximation algorithms for tree alignment with a given phylogeny
inferred← citeshttps://doi.org/10.1007/bf02061658openalex-snapshot
A primer of the Euclidean Steiner problem
inferred← citeshttps://doi.org/10.1007/bf02067239openalex-snapshot
Minimal length tree networks on the unit sphere
inferred← citeshttps://doi.org/10.1007/bf02067243openalex-snapshot
Steiner minimal trees for three points with one convex polygonal obstacle
inferred← citeshttps://doi.org/10.1007/bf02109861openalex-snapshot
Strong formulations and cutting planes for designing digital data service networks
inferred← citeshttps://doi.org/10.1007/bf02139131openalex-snapshot
Multicasting VP design methodology using simulated annealing in an ATM network
inferred← citeshttps://doi.org/10.1007/bfb0045104openalex-snapshot
Fixed topology steiner trees and spanning forests with applications in network communications
inferred← citeshttps://doi.org/10.1007/s00158-017-1743-zopenalex-snapshot
Support structure design in additive manufacturing based on topology optimization
inferred← citeshttps://doi.org/10.1007/s00453-001-0089-4openalex-snapshot
Approximations for a Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s00453-014-9868-6openalex-snapshot
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
inferred← citeshttps://doi.org/10.1007/s00453-016-0249-1openalex-snapshot
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
inferred← citeshttps://doi.org/10.1007/s00500-017-2630-7openalex-snapshot
A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the Steiner tree problem with revenue, budget and hop constraints
inferred← citeshttps://doi.org/10.1007/s00500-023-08923-1openalex-snapshot
A phenotype-based multi-objective evolutionary algorithm for maximizing lifetime in wireless sensor networks with bounded hop
inferred← citeshttps://doi.org/10.1007/s00778-007-0075-9openalex-snapshot
Précis: from unstructured keywords as queries to structured databases as answers
inferred← citeshttps://doi.org/10.1007/s10107-002-0357-3openalex-snapshot
The volume algorithm revisited: relation with bundle methods
inferred← citeshttps://doi.org/10.1007/s10107-016-0987-5openalex-snapshot
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
inferred← citeshttps://doi.org/10.1007/s10114-005-0910-0openalex-snapshot
Steiner Minimal Trees in Rectilinear and Octilinear Planes
inferred← citeshttps://doi.org/10.1007/s10462-012-9316-4openalex-snapshot
Fast semantic object search and detection for vegetable trading information using Steiner tree
inferred← citeshttps://doi.org/10.1007/s10479-005-3977-1openalex-snapshot
Non Delayed Relax-and-Cut Algorithms
inferred← citeshttps://doi.org/10.1007/s10479-013-1322-7openalex-snapshot
A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
inferred← citeshttps://doi.org/10.1007/s10589-007-9072-6openalex-snapshot
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
inferred← citeshttps://doi.org/10.1007/s10732-012-9198-2openalex-snapshot
Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems
inferred← citeshttps://doi.org/10.1007/s10732-015-9299-9openalex-snapshot
Interactive planning system for forest road location
inferred← citeshttps://doi.org/10.1007/s10878-005-5487-0openalex-snapshot
Two Variations of the Minimum Steiner Problem
inferred← citeshttps://doi.org/10.1007/s10878-019-00492-0openalex-snapshot
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s10878-021-00796-0openalex-snapshot
1-line minimum rectilinear steiner trees and related problems
inferred← citeshttps://doi.org/10.1007/s10878-023-01065-yopenalex-snapshot
Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
inferred← citeshttps://doi.org/10.1007/s10898-012-9967-3openalex-snapshot
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$
inferred← citeshttps://doi.org/10.1007/s10898-022-01163-xopenalex-snapshot
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s10922-020-09561-wopenalex-snapshot
Expand or Oversize? Planning Internet Access Network in a Demand Growth Scenario
inferred← citeshttps://doi.org/10.1007/s10957-023-02203-6openalex-snapshot
Structural Properties of Minimum Multi-source Multi-Sink Steiner Networks in the Euclidean Plane
inferred← citeshttps://doi.org/10.1007/s11042-010-0627-7openalex-snapshot
QoS and resource management in distributed interactive multimedia environments
inferred← citeshttps://doi.org/10.1007/s11067-015-9294-6openalex-snapshot
Finding Outbreak Trees in Networks with Limited Information
inferred← citeshttps://doi.org/10.1007/s11067-015-9308-4openalex-snapshot
Population-driven Urban Road Evolution Dynamic Model
inferred← citeshttps://doi.org/10.1007/s11107-006-0031-4openalex-snapshot
Wavelength assignment with sparse wavelength conversion for optical multicast in WDM networks
inferred← citeshttps://doi.org/10.1007/s11107-006-0042-1openalex-snapshot
Layered-routing approach for solving multicast routing and wavelength assignment problem
inferred← citeshttps://doi.org/10.1007/s11107-014-0480-0openalex-snapshot
Bandwidth-ratio-based light-tree selection in dynamic multicast traffic grooming for optical WDM mesh networks
inferred← citeshttps://doi.org/10.1007/s11235-021-00797-8openalex-snapshot
A survey on QoS routing protocols in Vehicular Ad Hoc Network (VANET)
inferred← citeshttps://doi.org/10.1007/s11235-026-01443-xopenalex-snapshot
Solving the constrained steiner tree problem in MANETs using an adaptive simulated annealing optimization approach
inferred← citeshttps://doi.org/10.1007/s11241-012-9171-zopenalex-snapshot
Optimal design of virtual links in AFDX networks
inferred← citeshttps://doi.org/10.1007/s11276-006-0724-8openalex-snapshot
Relay sensor placement in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11280-025-01399-zopenalex-snapshot
Toward real-world Table Agents: capabilities, workflows, and design principles for LLM-based table intelligence
inferred← citeshttps://doi.org/10.1007/s11590-020-01627-7openalex-snapshot
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane $${\mathbb {R}}^2$$
inferred← citeshttps://doi.org/10.1007/s11590-023-02058-wopenalex-snapshot
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
inferred← citeshttps://doi.org/10.1007/s11741-004-0071-xopenalex-snapshot
An improved multicast routing algorithm
inferred← citeshttps://doi.org/10.1007/s11767-004-0229-5openalex-snapshot
Routing and wavelength assignment algorithms based on equivalent networks
inferred← citeshttps://doi.org/10.1007/s12065-011-0049-0openalex-snapshot
Studying the application of ant colony optimization and river formation dynamics to the steiner tree problem
inferred← citeshttps://doi.org/10.1007/s12532-016-0102-1openalex-snapshot
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
inferred← citeshttps://doi.org/10.1007/s12532-018-0135-8openalex-snapshot
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
inferred← citeshttps://doi.org/10.1007/s13675-013-0016-xopenalex-snapshot
Towards optimizing the deployment of optical access networks
inferred← citeshttps://doi.org/10.1007/s13675-015-0035-xopenalex-snapshot
Optimal capacitated ring trees
inferred← citeshttps://doi.org/10.1007/s40305-022-00437-1openalex-snapshot
Approximation Algorithms for Solving the 1-Line Minimum Steiner Tree of Line Segments Problem
inferred← citeshttps://doi.org/10.1007/s40305-022-00443-3openalex-snapshot
Approximation Algorithms for Constructing Steiner Trees in the Euclidean Plane $$\mathbb {R}^2$$ Using Stock Pieces of Materials with Fixed Length
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0183-5openalex-snapshot
Steiner minimal trees on regular polygons with centre
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00275-2openalex-snapshot
Cut and patch Steiner trees for ladders
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90185-copenalex-snapshot
Worst-case performance of some heuristics for Steiner's problem in directed graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00034-4openalex-snapshot
A primal-dual approximation algorithm for the Steiner forest problem
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90055-1openalex-snapshot
On the Steiner ratio in 3-space
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90151-yopenalex-snapshot
Heuristics for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90092-3openalex-snapshot
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90050-mopenalex-snapshot
The shortest network under a given topology
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90214-topenalex-snapshot
A heuristic for Euclidean and rectilinear Steiner problems
inferred← citeshttps://doi.org/10.1016/j.actaastro.2012.02.004openalex-snapshot
Analysis of the contact graph routing algorithm: Bounding interplanetary paths
inferred← citeshttps://doi.org/10.1016/j.adhoc.2007.04.006openalex-snapshot
A secure group key management scheme for hierarchical mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.05.005openalex-snapshot
Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments
inferred← citeshttps://doi.org/10.1016/j.aeue.2007.05.004openalex-snapshot
Multicasting on translucent multicast capable WDM mesh networks
inferred← citeshttps://doi.org/10.1016/j.apenergy.2026.127938openalex-snapshot
A unified and adaptive real-time graph-theoretic optimization strategy for reconfigurable battery storage systems
inferred← citeshttps://doi.org/10.1016/j.apm.2011.02.046openalex-snapshot
Tree network design avoiding congestion
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107253openalex-snapshot
Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem
inferred← citeshttps://doi.org/10.1016/j.chaos.2023.113654openalex-snapshot
Average path length and Fermat distance in fractal networks composed of high-dimensional Sierpiński pyramids
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.01.018openalex-snapshot
Multicast routing for multimedia collaborative applications
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.02.015openalex-snapshot
QoS multicast routing for multimedia group communications using intelligent computational methods
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.02.004openalex-snapshot
On full Steiner trees in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.12.012openalex-snapshot
On multicasting in wavelength-routing mesh networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.02.001openalex-snapshot
Preplanned restoration of multicast demands in optical networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.02.005openalex-snapshot
Optimal configuration of an optical network providing predefined multicast transmissions
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.comnet.2019.106903openalex-snapshot
Efficient inter-datacenter bulk transfers with mixed completion time objectives
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2019.101370openalex-snapshot
Automatic mapping of urban wastewater networks based on manhole cover locations
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.cor.2013.07.023openalex-snapshot
Looking for edge-equitable spanning trees
showing the first 200 of 627 · page through all 627
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.