Brief announcement: Exponential speed-up of local algorithms using non-local communication

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 295-296

  Lenzen, Christoph ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

All to all communication; Local algorithms; Simulation

Indexed keywords

ALL-TO-ALL COMMUNICATION; GRAPH PROBLEMS; LOCAL ALGORITHM; MAXIMUM DEGREE; MEMORY RESTRICTIONS; NONLOCAL; POLYLOGARITHMIC; RUNNING TIME; SIMULATION; SPEED-UPS;

ALGORITHMS; COMMUNICATION;

TELECOMMUNICATION SYSTEMS;

EID: 77956239323     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835772     Document Type: Conference Paper

References (9)

1. I. Dinur and S. Safra. On the Hardness of Approximating Minimum Vertex Cover. Annals of Mathematics, 162:2005, 2004.
2. R. M. Karp. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
3. S. Khot and O. Regev. Vertex Cover Might be Hard to Approximate to within 2-ε. J. Comput. Syst. Sci., 74(3):335-349, 2008.
4. C. Koufogiannakis and N. E. Young. Distributed and Parallel Algorithms for Weighted Vertex Cover and other Covering Problems. In Proc. of the 28th ACM symposium on Principles of distributed computing (PODC), pages 171-179, 2009.
5. F. Kuhn, T. Moscibroda, and R. Wattenhofer. The Price of Being Near-Sighted. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2006.
6. Z. Lotker, B. Patt-Shamir, and S. Pettie. Improved Distributed Approximate Matching. In Proc. 20th annual Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 129-136, 2008.
7. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput., 15(4):1036-1055, 1986.
8. Y. Métivier, J. M. Robson, N. Saheb Djahromi, and A. Zemmari. An optimal bit complexity randomised distributed MIS algorithm. In Proc. 16th International Colloquium on Structural Information and Communication Complexity, pages 1-15, Piran, Slovenia, 2009.
9. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proc. 29th annual ACM Symposium on Theory of Computing (STOC), pages 475-484, New York, NY, USA, 1997.