Abstract
This paper addresses the classic online Steiner tree problem on edge-weighted graphs. It is known that a greedy (nearest neighbor) online algorithm has a tight competitive ratio for wide classes of graphs, such as trees, rings, any class including series-parallel graphs, and unweighted graphs with bounded diameter. However, we do not know any greedy or non-greedy tight deterministic algorithm for other classes of graphs. In this paper, we observe that a greedy algorithm is $$\Omega (\log n)$$ -competitive on outerplanar graphs, where n is the number of vertices, and propose a 5.828-competitive deterministic algorithm on outerplanar graphs. Our algorithm connects a requested vertex and the tree constructed thus far using a path that is constant times longer than the distance between them. We also present a lower bound of 4 for arbitrary deterministic online Steiner tree algorithms on outerplanar graphs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
