Corpus ID: 35333427

Tree , Metric Labeling , Buyat-Bulk Network Design , and

@inproceedings{Rcke2008TreeM,
  title={Tree , Metric Labeling , Buyat-Bulk Network Design , and},
  author={Harald R{\"a}cke},
  year={2008}
}
Hierarchical graph decompositions play an important role in the design of approximation and online algorithms for graph problems. This is mainly due to the fact that the results concerning the approximation of metric spaces by tree metrics (e.g. [10, 11, 14, 16]) depend on hierarchical graph decompositions. In this line of work a probability distribution over tree graphs is constructed from a given input graph, in such a way that the tree distances closely resemble the distances in the original… Expand

Figures from this paper

References

SHOWING 1-10 OF 30 REFERENCES
Approximation Algorithms for Requirement Cut on Graphs
  • 9
A polynomial-time tree decomposition to minimize congestion
  • 126
  • Highly Influential
A general approach to online network optimization problems
  • 119
  • Highly Influential
  • PDF
A tight bound on approximating arbitrary metrics by tree metrics
  • 849
  • PDF
Expander flows, geometric embeddings and graph partitioning
  • 309
  • PDF
A practical algorithm for constructing oblivious routing schemes
  • 100
  • PDF
Minimizing Congestion in General Networks
  • 246
  • PDF
Approximating a finite metric by a small number of tree metrics
  • 208
  • Highly Influential
  • PDF
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  • F. Leighton, S. Rao
  • Mathematics, Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
  • 529
  • PDF
A Polylogarithmic Approximation of the Minimum Bisection
  • 75
  • Highly Influential
...
1
2
3
...