Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems
Sign Up to like & getrecommendations! Published in 2019 at "Theory of Computing Systems"
DOI: 10.1007/s00224-019-09922-2
Abstract: In this paper we study the online variant of two well-known Steiner tree problems. In the online setting, the input consists of a sequence of terminals; upon arrival of a terminal, the online algorithm must… read more here.
Keywords: online priority; priority; weighted steiner; node weighted ... See more keywords