An approximation scheme for some Steiner tree problems in the plane

Wang, Lusheng; Jiang, Tao

doi:10.1002/(sici)1097-0037(199612)28:4<187::aid-net3>3.3.co;2-s

Search citation statements

Order By: Relevance

Paper Sections

Select...

Model and Previous Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2002

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the above algorithms do not address the on-line problem. Various interesting heuristics exist for the static Steiner tree problem [14,16,20,29,23] for a survey see [27,18].…”

Section: Model and Previous Workmentioning

confidence: 99%

The Effect of Asymmetry on the on-Line Multicast Routing Problem

Faloutsos

Pankaj

Sevcik

2002

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

In this paper, we study the problem of multicast routing on directed graphs. We define the asymmetry of a graph to be the maximum ratio of weights on opposite directed edges between a pair of nodes for all node-pairs. We examine three types of problems according the membership behavior: (i) the static, (ii) the join-only, (iii) the join-leave problems. We study the effect of the asymmetry on the worst case performance of two algorithms: the Greedy and Shortest Paths algorithms. The worst case performance of Shortest Paths is poor, but it is affected by neither the asymmetry nor the membership behavior. In contrast, the worst case performance of Greedy is a proportional to the asymmetry in a some cases. We prove an interesting result for the join-only problem: the Greedy algorithm has near-optimal on-line performance. 889 Int. J. Found. Comput. Sci. 2002.13:889-910. Downloaded from www.worldscientific.com by FLINDERS UNIVERSITY LIBRARY on 02/07/15. For personal use only.

show abstract

“…Note that the above algorithms do not address the on-line problem. Various interesting heuristics exist for the static Steiner tree problem [14,16,20,29,23] for a survey see [27,18].…”

Section: Model and Previous Workmentioning

confidence: 99%