Online Network Design Algorithms via Hierarchical Decompositions

@article{Umboh2015OnlineND,
  title={Online Network Design Algorithms via Hierarchical Decompositions},
  author={Seeun Umboh},
  journal={ArXiv},
  year={2015},
  volume={abs/1410.4240}
}
  • Seeun Umboh
  • Published 2015
  • Mathematics, Computer Science
  • ArXiv
  • We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple analyses. At the heart of our work is a novel application of embeddings into hierarchically well-separated trees (HSTs) to the analysis of online network design algorithms --- we charge the cost of the algorithm to the cost of the optimal solution on any HST embedding of the terminals. This analysis technique is widely… CONTINUE READING
    Online Constrained Forest and Prize-Collecting Network Design
    2
    Universal Network Cost-Sharing Design
    Dynamic Balanced Graph Partitioning
    3
    Designing Networks with Good Equilibria under Uncertainty
    9

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    Online and stochastic survivable network design
    31
    On-line generalized Steiner problem
    97
    When trees collide: an approximation algorithm for the generalized Steiner problem on networks
    363
    Buy-at-bulk network design
    182
    An O(logn)-Competitive Algorithm for Online Constrained Forest Problems
    12
    When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
    309
    On-line algorithms for Steiner tree problems (extended abstract)
    69
    A factor 2 approximation algorithm for the generalized Steiner network problem
    • K. Jain
    • Computer Science, Mathematics
    • 1998
    426
    A tight bound on approximating arbitrary metrics by tree metrics
    770