AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

AI 精读

AI抽取本论文的概要总结


微博一下
We show that an arbitrary metic space can be approximated by a distribution over dominating tree metrics with distortion O, closing the gap between the lower and the upper bounds

A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003, no. 3 (2004): 485-497

引用917|浏览160
EI

摘要

In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon the result of Bartal who gave a bound of O(log n log log n). Moreover, our result is existentially tight; there exist metric spaces where any tree ...更多

代码

数据

简介
  • 1.1 Metric approximations

    The problem of approximating a given graph metric by a “simpler” metric has been a subject of extensive research, motivated from several different perspectives.
  • Karp, Peleg and West [1] looked at approximating arbitrary graph metrics by spanning trees, and showed an upper bound of 2O on the distortion.
  • Bartal [7] formally defined probabilistic embeddings and improved on the previous result by showing how to probabilistically approximate metrics by tree metrics with distortion O.
重点内容
  • The problem of approximating a given graph metric by a “simpler” metric has been a subject of extensive research, motivated from several different perspectives
  • Point of view, is a tree metric, i.e. a metric arising from shortest path distance on a tree containing the given points
  • We show that an arbitrary metic space can be approximated by a distribution over dominating tree metrics with distortion O, closing the gap between the lower and the upper bounds
  • The problem of probabilistic approximation by tree metrics asks for a distribution over tree metrics such that the expected stretch of each edge is small
结果
  • This gives improved approximation algorithms for various problems including group Steiner tree [24], metric labeling [19, 32], buy-at-bulk network design [4], and vehicle routing [16].
  • The authors outline the algorithm for probabilistically embedding an n point metric into a tree, and show that the expected distortion of any distance is O.
  • The authors first decompose the graph hierarchically and convert the resulting laminar family to a tree.
  • The authors shall describe a random process to define a hierarchical cut decomposition of (V, d), such that the probability that an edge (u, v) is at level i decreases geometrically with i.
  • The authors shall bound the probability that w cuts u out of (u, v) at level i.
  • This implies that the probability that u gets cut out of edge e is bounded by kiu s=k +1
  • The distribution over tree metrics resulting from the algorithm O-probabilistically approximates the metric d.
  • A tree T is said to be k-hierarchically well separated if on any root to leaf path the edge lengths decrease by a factor of k in each step.
  • The problem of probabilistic approximation by tree metrics asks for a distribution over tree metrics such that the expected stretch of each edge is small.
  • The partitioning algorithm the authors give produces a tree such that the expected stretch of each edge is at most O.
结论
  • The metric labeling problem : The previous result of Kleinberg and Tardos [32] gives an O-approximation algorithm based on a constant factor approximation for the case that the terminal metric is an HST.
  • Metrical Task system : Improving on the result of Bartal, Blum, Burch and Tomkins [10], Fiat and Mendel [22] gave an O-competitive algorithms on HSTs. Bartal and Mendel’s [12] multiembedding result gives an O(λ log n log log n)-competitive ratio, where λ is as defined above.
  • The result improves the performance guarantees of several other problems such as vehicle routing [16], min sum clustering [11, 9], covering steiner tree [33], hierarchical placement [35], topology aggregation [6, 44], mirror placement [29], distributed K-server [13], distributed queueing [27] and mobile user [5].
相关工作
  • Divide and conquer methods have been used to provide polylogarithmic-factor approximation algorithms for numerous graph problems since the discovery of an O(log n) approximation algorithm for finding a graph separator [36]. The algorithms proceeded by recursively dividing a problem using the above approximation algorithm, and then using the decomposition to find a solution. Typically, the approximation factor was O(log2 n): a logarithmic factor came from the O(log n) separator approximation, another O(log n) factor came from the recursion. Using this framework, polynomial-time approximation algorithms for many problems are given in [36], for example: crossing number, VLSI layout, minimum feedback arc set, and search number.

    Independently, Seymour [45] gave an O(log n log log n) bound on the integrality gap for a linear programming relaxation of the feedback arc set problem (for which the above techniques had given an O(log2 n) bound). In doing so, he developed a technique that balanced the approximation factor of his separator based procedure against the cost of the recursion to significantly improve the bounds.
引用论文
  • N. Alon, R. M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1):78–100, Feb. 1995.
    Google ScholarLocate open access versionFindings
  • A. Archer, K. Talwar, and E. Tardos. Personal Communication, 2003.
    Google ScholarLocate open access versionFindings
  • Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291–301, 1998.
    Google ScholarLocate open access versionFindings
  • B. Awerbuch and Y. Azar. Buy-at-bulk network design. In 38th Annual Symposium on Foundations of Computer Science, pages 542–547, Miami Beach, Florida, 20–22 Oct. 1997.
    Google ScholarLocate open access versionFindings
  • B. Awerbuch and D. Peleg. Concurrent online tracking of mobile users. In SIGCOMM, pages 221–233, 1991.
    Google ScholarLocate open access versionFindings
  • B. Awerbuch and Y. Shavitt. Topology aggregation for directed graphs. In Proceedings of IEEE ISCC (Athens, Greece),pp. 47–52, 1998.
    Google ScholarLocate open access versionFindings
  • Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In IEEE Symposium on Foundations of Computer Science, pages 184–193, 1996.
    Google ScholarLocate open access versionFindings
  • Y. Bartal. On approximating arbitrary metrics by tree metrics. In STOC, 1998.
    Google ScholarLocate open access versionFindings
  • Y. Bartal. A constant factor approximation for min sum clustering on HSTs. Personal Communication, 2003.
    Google ScholarFindings
  • Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 711–719, El Paso, Texas, 4–6 May 1997.
    Google ScholarLocate open access versionFindings
  • Y. Bartal, M. Charikar and R. Raz. Approximating min-sum k-clustering in metric spaces. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 11–20, Hersonissos, Crete, Greece 6–8 July 2001.
    Google ScholarLocate open access versionFindings
  • Y. Bartal and M. Mendel. Multi-embedding and path approximation of metric spaces. In Symposium on Discrete Algorithms, 2003.
    Google ScholarLocate open access versionFindings
  • Y. Bartal and A. Rosen. The distributed k-server problem-a competitive distributed translator for k-server algorithms. In IEEE Symposium on Foundations of Computer Science, pages 344–353, 1992.
    Google ScholarLocate open access versionFindings
  • J. Bourgain. On lipschitz embeddings of finite metric spaces in hilbert space. Israel Journal of Mathematics, 52(1-2):46–52, 1985.
    Google ScholarLocate open access versionFindings
  • G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 8–16, 2001.
    Google ScholarLocate open access versionFindings
  • M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In STOC, pages 114–123, 1998.
    Google ScholarLocate open access versionFindings
  • M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. A. Plotkin. Approximating a finite metric by a small number of tree metrics. In IEEE Symposium on Foundations of Computer Science, pages 379–388, 1998.
    Google ScholarLocate open access versionFindings
  • C. Chekuri, A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Embedding k-outerplanar graphs into l1. In SODA, 2003.
    Google ScholarFindings
  • C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Symposium on Discrete Algorithms, pages 109–118, 2001.
    Google ScholarLocate open access versionFindings
  • G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics (extended abstract). In IEEE Symposium on Foundations of Computer Science, pages 62–71, 1995.
    Google ScholarLocate open access versionFindings
  • J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation for the 0-extension problem. In Symposium on Discrete Algorithms, 2003.
    Google ScholarLocate open access versionFindings
  • A. Fiat and M. Mendel. Better algorithms for unfair metrical task systems and applications. In Proceedings of the 32nd STOC, pages 725-734, 2000.
    Google ScholarLocate open access versionFindings
  • U. Feige. Approximating the bandwidth via volume respecting embeddings (extended abstract). In ACM, editor, Proceedings of the thirtieth annual ACM STOC, pages 90–99, 1998.
    Google ScholarLocate open access versionFindings
  • N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. Journal of Algorithms, 37, 2000.
    Google ScholarLocate open access versionFindings
  • A. Gupta. Steiner points in tree metrics don’t (really) help. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 220–227. ACM Press, 2001.
    Google ScholarLocate open access versionFindings
  • A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Cuts, trees and l1-embeddings of graphs. In 40th FOCS, pages 399–408, 1999.
    Google ScholarLocate open access versionFindings
  • M. Herlihy, S. Tirthapura, and R. Wattenhofer. Competitive concurrent distributed queueing. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing 2001.
    Google ScholarLocate open access versionFindings
  • T. C. Hu. Optimum communication spanning trees. SIAM J. Computing, 3:188–195, 1974.
    Google ScholarLocate open access versionFindings
  • S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. On the placement of internet instrumentation. In Proceedings of IEEE INFOCOM (Tel-Aviv, Israel), 2000.
    Google ScholarLocate open access versionFindings
  • R. Karp. A 2k-competitive algorithm for the circle. Manuscript, August 1989.
    Google ScholarLocate open access versionFindings
  • P. N. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In ACM Symposium on Theory of Computing, pages 682–690, 1993.
    Google ScholarLocate open access versionFindings
  • J. M. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields. In IEEE Symposium on Foundations of Computer Science, pages 14–23, 1999.
    Google ScholarLocate open access versionFindings
  • G. Konjevod and R. Ravi. An approximation algorithm for the covering steiner problem. Symposium on Discrete Algorithms, pp. 338–344, 2000.
    Google ScholarFindings
  • G. Konjevod, R. Ravi, and F. Salman. On approximating planar metrics by tree metrics. IPL: Information Processing Letters, 80, 2001.
    Google ScholarLocate open access versionFindings
  • M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms pp. 586–595, 1999.
    Google ScholarLocate open access versionFindings
  • T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In IEEE Symposium on Foundations of Computer Science, pages 422–431, 1988.
    Google ScholarLocate open access versionFindings
  • N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. COMBINAT: Combinatorica, 15, 1995.
    Google ScholarLocate open access versionFindings
  • J. Matousek. Lectures on discrete geometry. Springer, in press.
    Google ScholarFindings
  • I. Newman and Y. Rabinovich. A lower bound on the distortion of embedding planar metrics into euclidean space. In Proceedings of the eighteenth annual symposium on Computational geometry, pages 94–96. ACM Press, 2002.
    Google ScholarLocate open access versionFindings
  • D. Peleg and E. Reshef. Deterministic polylog approximation for minimum communication spanning trees. Lecture Notes in Computer Science, 1443:670–681, 1998.
    Google ScholarLocate open access versionFindings
  • Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. GEOMETRY: Discrete & Computational Geometry, 19, 1998.
    Google ScholarLocate open access versionFindings
  • P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37(2):130–143, Oct. 1988.
    Google ScholarLocate open access versionFindings
  • S. Rao. Small distortion and volume preserving embeddings for planar and euclidean metrics. In Proceedings of the fifteenth annual symposium on Computational geometry, pages 300–306. ACM Press, 1999.
    Google ScholarLocate open access versionFindings
  • Y. Shavitt Topology aggregation for networks with hierarchical structure: A practical approach. In Proceedings of 36th Annual Allerton Conference on Communication, Control, and Computing (Allerton Park, Illinois), 1998.
    Google ScholarLocate open access versionFindings
  • P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281–288, 1995.
    Google ScholarLocate open access versionFindings
  • B. Y. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C. Y. Tang. A polynomial time approximation scheme for mimimum routing cost spanning trees. In ACM-SIAM Symposium on Discrete Algorithms, 1998.
    Google ScholarLocate open access versionFindings
0
您的评分 :

暂无评分

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn