v1v2v3 (latest)

Distributed Verification and Hardness of Distributed Approximation

12 November 2010

Roger Wattenhofer

Papers citing "Distributed Verification and Hardness of Distributed Approximation"

50 / 141 papers shown

Title
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST Yuval Efron O. Grossman Seri Khoury 90 6 0 16 Mar 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 57 7 0 18 Feb 2020
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 46 10 0 06 Nov 2019
Behavior Mixing with Minimum Global and Subgroup Connectivity Maintenance for Large-Scale Multi-Robot Systems Jingrong Lin Sha Yi Katia Sycara 19 18 0 03 Oct 2019
Low Diameter Graph Decompositions by Approximate Distance Computation R. Becker Y. Emek Christoph Lenzen 18 9 0 19 Sep 2019
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 39 31 0 04 Sep 2019
Low-Congestion Shortcut and Graph Parameters Naoki Kitamura Hirotaka Kitagawa Y. Otachi Taisuke Izumi 29 9 0 26 Aug 2019
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach M. Parter 68 28 0 08 Aug 2019
Faster asynchronous MST and low diameter tree construction with sublinear communication A. Mashreghi Valerie King 54 12 0 28 Jul 2019
$Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$$ Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ Parikshit Saikia Sushanta Karmakar 8 9 0 28 Jul 2019
What graph neural networks cannot learn: depth vs width Andreas Loukas GNN 93 301 0 06 Jul 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 30 35 0 06 Jun 2019
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 66 17 0 26 May 2019
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 46 41 0 24 May 2019
Connectivity Lower Bounds in Broadcast Congested Clique Shreyas Pai Sriram V. Pemmaraju 18 11 0 22 May 2019
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators Lijie Chen O. Grossman 38 6 0 19 May 2019
Brief Announcement: Does Preprocessing Help under Congestion? Klaus-Tycho Foerster Janne H. Korhonen Joel Rybicki Stefan Schmid 25 2 0 08 May 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 55 40 0 08 Apr 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 44 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 41 4 0 05 Nov 2018
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 48 47 0 17 Jul 2018
Parameterized Distributed Algorithms Ran Ben-Basat Ken-ichi Kawarabayashi Gregory Schwartzman 46 14 0 13 Jul 2018
Detecting cliques in CONGEST networks A. Czumaj C. Konrad 48 36 0 03 Jul 2018
Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model A. Mashreghi Valerie King 69 29 0 12 Jun 2018
Distributed Algorithms for Minimum Degree Spanning Trees M. Dinitz Magnús M. Halldórsson Calvin C. Newport 35 3 0 08 Jun 2018
Distributed Approximation of Minimum $k$ -edge-connected Spanning Subgraphs Michal Dory 53 16 0 20 May 2018
Distributed Computation in Node-Capacitated Networks John E. Augustine M. Ghaffari R. Gmyr Kristian Hinnenthal Fabian Kuhn Jason Li Christian Scheideler 13 2 0 18 May 2018
Redundancy in Distributed Proofs Laurent Feuilloley Pierre Fraigniaud J. Hirvonen A. Paz M. Perry 46 28 0 08 Mar 2018
Faster Distributed Shortest Path Approximations via Shortcuts Bernhard Haeupler Jason Li 43 36 0 11 Feb 2018
Distributed Spanner Approximation K. Censor-Hillel Michal Dory 64 25 0 09 Feb 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 46 32 0 18 Jan 2018
Round- and Message-Optimal Distributed Graph Algorithms Bernhard Haeupler D Ellis Hershkowitz David Wajc 53 5 0 16 Jan 2018
Improved Distributed Algorithms for Exact Shortest Paths M. Ghaffari Jason Li 49 60 0 25 Dec 2017
Fast Distributed Approximation for TAP and 2-Edge-Connectivity K. Censor-Hillel Michal Dory 60 12 0 09 Nov 2017
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion Amir Abboud K. Censor-Hillel Seri Khoury Christoph Lenzen 71 29 0 05 Nov 2017
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 58 66 0 03 Nov 2017
Proof-Labeling Schemes: Broadcast, Unicast and In Between B. Patt-Shamir M. Perry 53 21 0 23 Aug 2017
$Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds$ Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak 44 45 0 13 Aug 2017
Distributed Subgraph Detection Pierre Fraigniaud Pedro Montealegre Dennis Olivetti I. Rapaport Ioan Todinca 63 11 0 13 Jun 2017
Triangle Finding and Listing in CONGEST Networks Taisuke Izumi F. Gall 54 56 0 25 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 70 55 0 16 May 2017
Towards a complexity theory for the congested clique Janne H. Korhonen Jukka Suomela 39 43 0 09 May 2017
How Bandwidth Affects the $CONGEST$ Model Dennis Olivetti 24 0 0 20 Apr 2017
Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages Sriram V. Pemmaraju Vivek Sardeshmukh LRM 37 14 0 12 Oct 2016
Tight Network Topology Dependent Bounds on Rounds of Communication A. Chattopadhyay M. Langberg Shi Li Atri Rudra 18 5 0 10 Aug 2016
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions K. Censor-Hillel M. Parter Gregory Schwartzman 79 75 0 04 Aug 2016
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees Gopal Pandurangan Peter Robinson Michele Scquizzato 19 9 0 23 Jul 2016
Distributed Construction of Purely Additive Spanners K. Censor-Hillel T. Kavitha A. Paz Amir Yehudayoff 38 27 0 19 Jul 2016
Multi-Party Protocols, Information Complexity and Privacy Iordanis Kerenidis A. Rosén Florent Urrutia 26 5 0 22 Jun 2016