Name
Abstract | ||
|---|---|---|
In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berman and Coulston (Proceedings of the 29th annual ACM symposium on theory of computing, pp 344–353, 1997) and one for (offline) general network design problems due to Goemans and Williamson (SIAM J Comput 24:296–317, 1995); we give an \(O(\log k)\)-competitive algorithm, where k is the number of nodes that must be connected. We also consider a further generalization of the problem that allows us to pay penalties in exchange for violating connectivity constraints; we give an online \(O(\log k)\)-competitive algorithm for this case as well. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s00453-017-0391-4 | Algorithmica |
Keywords | DocType | Volume |
Online algorithms,Competitive ratio,Generalized Steiner tree,Prize-collecting Steiner tree | Journal | abs/1702.04871 |
Issue | ISSN | Citations |
11 | 0178-4617 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiawei Qianand | 1 | 29 | 1.82 |
| Seeun William Umboh | 2 | 0 | 1.01 |
| David P. Williamson | 3 | 3564 | 413.34 |