Probabilistic approximation of metric spaces and its algorithmic applications
暂无分享,去创建一个
[1] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[2] R. Graham,et al. Isometric embeddings of graphs. , 1984, Proceedings of the National Academy of Sciences of the United States of America.
[3] R. Graham,et al. On isometric embeddings of graphs , 1985 .
[4] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[5] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[6] O. Sheng. Dynamic File Migration in Distributed Computer Systems , 1990, ICIS.
[7] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[8] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.
[9] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[10] David L. Black,et al. Competitive algorithms for replication and migration problems , 1989 .
[11] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[12] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[13] Baruch Awerbuch,et al. Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[14] Michael E. Saks,et al. Decomposing graphs into regions of small diameter , 1991, SODA '91.
[15] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[16] Alain Guénoche,et al. Trees and proximity representations , 1991, Wiley-Interscience series in discrete mathematics and optimization.
[17] Marek Chrobak,et al. An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..
[18] Baruch Schieber,et al. Navigating in unfamiliar geometric terrain , 1991, STOC '91.
[19] Giri Narasimhan,et al. New sparseness results on graph spanners , 1992, SCG '92.
[20] L. Cai. Tree spanners: spanning trees that approximate distances , 1992 .
[21] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[22] Yuval Rabani,et al. A decomposition theorem and bounds for randomized server problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[23] Amos Fiat,et al. Competitive distributed file allocation , 1993, STOC '93.
[24] Amos Fiat,et al. Heat and Dump: competitive distributed paging , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[25] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[26] N. Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, FOCS.
[27] Cynthia Dwork,et al. A theory of competitive analysis for distributed algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[28] E. Koutsoupias,et al. On the k-server conjecture , 1994, STOC '94.
[29] Carsten Lund,et al. On-Line Distributed Data Management , 1994, ESA.
[30] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..
[31] Amos Fiat,et al. Competitive access time via dynamic storage rearrangement , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[32] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[33] Sandy Irani,et al. Randomized Algorithms for Metrical Task Systems , 1995, Theor. Comput. Sci..
[34] Yuval Rabani,et al. Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..
[35] Susanne Albers,et al. Page Migration with Limited Local Memory Capacity , 1995, WADS.
[36] Leizhen Cai,et al. Tree Spanners , 1995, SIAM J. Discret. Math..
[37] Joseph Naor,et al. Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[38] Christos H. Papadimitriou,et al. On the k-server conjecture , 1995, JACM.
[39] Yossi Azar,et al. On-line generalized Steiner problem , 1996, SODA '96.
[40] Amos Fiat,et al. Distributed paging for general networks , 1996, SODA '96.
[41] Babu O. Narayanan,et al. On the approximability of numerical taxonomy , 1996 .
[42] Piotr Indyk,et al. On page migration and other relaxed task systems , 1997, SODA '97.
[43] Adi Rosén,et al. The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms , 1997, J. Algorithms.
[44] Ran Raz,et al. Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs , 1998, Discret. Comput. Geom..