Dynamic Steiner Tree Problem

@article{Imase1991DynamicST,
  title={Dynamic Steiner Tree Problem},
  author={Makoto Imase and Bernard M. Waxman},
  journal={SIAM J. Discrete Math.},
  year={1991},
  volume={4},
  pages={369-384}
}
This paper proposes a new problem, which we call the Dynamic Steiner Tree Problem. This is related to multipoint connection routing in communications networks, where the set of nodes to be connected changes over time. This problem can be divided into two cases, one in which rearrangement of existing routes is not allowed and a second in which rearrangement is allowed. In the first case, we show that there is no algorithm whose worst error ratio is less than 1/2 log n where n is the number of… CONTINUE READING
Highly Influential
This paper has highly influenced 50 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 221 extracted citations

Algorithms and Data Structures

Lecture Notes in Computer Science • 2017
View 10 Excerpts
Highly Influenced

Approximation and Online Algorithms

Lecture Notes in Computer Science • 2017
View 12 Excerpts
Highly Influenced

From Cost Sharing Mechanisms to Online Selection Problems

Math. Oper. Res. • 2015
View 4 Excerpts
Highly Influenced

Software Defined Mobile Multicast

2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems • 2015
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…