A simple polynomial-time randomized distributed algorithm for connected row convex constraints

• المؤلفون الرئيسيون: KUMAR, T. K. Satish, NGUYEN DUC THIEN, YEOH, William, KOENIG, Sven
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2014
• الموضوعات: Computer Sciences; Theory and Algorithms
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/3464; https://ink.library.smu.edu.sg/context/sis_research/article/4465/viewcontent/C110___A_Simple_Polynomial_Time_Randomized_Distributed_Algorithm_for_Connected_Row_Convex_Constraints__AAAI2014_.pdf
• المؤسسة: Singapore Management University

In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in...