Data structures that allow efficient distance estimation have been extensively studied both in centralized models and classical distributed models. We initiate their study in newer (and arguably more realistic) models of distributed computation: the Congested Clique model and the Massively Parallel Computation (MPC) model. In MPC we give two main results: an algorithm that...
University of the Negev , Beersheva , Israel 2 Michael Dinitz Johns Hopkins University , Baltimore, MD , USA The `p-norm of the degree vector was recently introduced by [Chlamtáč, Dinitz, Robinson ICALP '19 ... Theory of computation → Sparsification and spanners Funding Eden Chlamtáč : Supported in part by ISF grant 1002/14. Michael Dinitz: Supported in part by NSF awards CCF-1464239 and CCF-1535887. Thomas
University of the Negev , Beersheva , Israel 2 Michael Dinitz Johns Hopkins University , Baltimore, MD , USA A t-spanner of a graph G is a subgraph H in which all distances are preserved up to a ... ://arxiv.org/abs/1903.07418. Funding Eden Chlamt?? : Supported in part by ISF grant 1002/14. Michael Dinitz: Supported in part by NSF awards CCF-1464239 and CCF-1535887. Thomas Robinson: Supported in part by ISF
University , Baltimore, Maryland , USA 2 Michael Dinitz Johns Hopkins University , Baltimore, Maryland , USA We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a ... preprint Eden Chlamt?c, Michael Dinitz, Guy Kortsarz, and Bundit Laekhanukit. Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. In Proceedings of the Twenty-Eighth Annual ACM-SIAM
log n) rounds (by Theorem 13) in the LOCAL model. In [6], it was shown that this leads to a O?(?(1?1/k)2 )-approximation solution of the problem. Amy Babay , Emily Wagner, Michael Dinitz , and Yair ... of Computing , 12 ( 1 ): 1 - 29 , 2016 . Eden Chlamt?c , Michael Dinitz, Guy Kortsarz, and Bundit Laekhanukit . Approximating spanners and directed steiner forest: Upper and lower bounds . In SODA
, Michael Dinitz , and Michael Schapira . Xpander: Towards optimal-performance datacenters . In Proceedings of the 12th International on Conference on Emerging Networking EXperiments and Technologies , CoNEXT
gossip problem in this model. 2012 ACM Subject Classification Computing methodologies → Distributed algorithms; Networks → Network algorithms Funding Michael Dinitz: Supported in part by NSF award CCF ... and Communication Complexity , 2016 . Michael Dinitz , Jeremy Fineman, Seth Gilbert, and Calvin Newport . Load balancing with bounded convergence in dynamic networks . In INFOCOM , pages 1 - 9 , 2017
) , volume 28 , pages 80 - 95 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014 . Eden Chlamtac , Michael Dinitz , and Robert Krauthgamer . Everywhere-sparse spanners via dense subgraphs . In ... Annual ACM Symposium on Theory of Computing , pages 323 - 332 . ACM, 2011 . URL: https://arxiv.org/abs/1612.05623. Michael Dinitz and Zeyu Zhang . Approximating low-stretch spanners . In Proceedings of the
Johns Hopkins University , Baltimore, MD , USA 2 Michael Dinitz Johns Hopkins University , Baltimore, MD , USA We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective ... hardness result for a generalized version of the MCC problem from [3], which will allow us to modify our reduction from Theorem 5 to get hardness of approximation. Amy Babay , Emily Wagner, Michael Dinitz
We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron...
We study resistance sparsification of graphs, in which the goal is to find a sparse subgraph (with reweighted edges) that approximately preserves the effective resistances between every pair of nodes. We show that every dense regular expander admits a (1+epsilon)-resistance sparsifier of size ~O(n/epsilon), and conjecture this bound holds for all graphs on n nodes. In comparison...
ICALP (1) , pages 1 - 12 , 2011 . Woodruff . Transitive-closure spanners . In SODA'09 , pages 932 - 941 , 2009 . T.-H. Hubert Chan , Michael Dinitz , and Anupam Gupta . Spanners with slack . In ... , pages 435 - 444 , New York, NY, USA, 2009 . ACM. Shiri Chechik . New additive spanners . In SODA'13 , pages 498 - 512 , 2013 . Eden Chlamt?? , Michael Dinitz , and Robert Krauthgamer . Everywhere-sparse
2000, Saarbr?cken, Germany, September 5- 8 , 2000 , Proceedings, pages 84 - 95 , 2000 . doi: 10 .1007/3-540-44436-X_ 10 . Eden Chlamtac , Michael Dinitz , and Robert Krauthgamer . Everywhere-sparse
edge profits that are polynomial in n, which may be of independent interest. 1998 ACM Subject Classification G.2.2 Graph Theory: Graph algorithms ? Michael Dinitz, Guy Kortsarz, and Zeev Nutov; licensed
