Steiner tree problems-Reference-Cited by-同舟云学术

Steiner tree problems

Published:1992-01 Issue:1 Volume:22 Page:55-89
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Hwang F. K.,Richards Dana S.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference310 articles.

1. Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle

2. Rectilinear steiner trees: Efficient special-case algorithms

3. An integer linear programming approach to the steiner problem in graphs

4. , and , Problems easy for tree-decomposable graphs. Automata Languages and Programming [LNCS 317] ( and , Eds.) Springer-Verlag, Berlin (1988) 38–51.

5. , and , Le Probleme de Steiner sur un Graphe Oriente: Formulations and Relaxations. Publication 315. Centre de Recherche sur les Transports, University of Montreal (1983).

Cited by 375 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reviewing extensions and solution methods of the planar Weber single facility location problem;Computers & Operations Research;2025-01

2. The average Steiner (3,2)-eccentricity of trees;Discrete Applied Mathematics;2024-10

3. Multi-User Entanglement Routing Design over Quantum Internets;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23

4. An online transfer learning based multifactorial evolutionary algorithm for solving the clustered Steiner tree problem;Knowledge-Based Systems;2024-07

5. Resource-aware Deployment of Dynamic DNNs over Multi-tiered Interconnected Systems;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20