A tight linear time (1/2)-approximation for unconstrained submodular maximization

Niv Buchbinder, Moran Feldman, Joseph Seffi Naor, Roy Schwartz

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

We consider the Unconstrained Submodular Maximization problem in which we are given a nonnegative submodular function f : 2N → R+, and the objective is to find a subset S ⊆ N maximizing f(S). This is one of the most basic submodular optimization problems, having a wide range of applications. Some well-known problems captured by Unconstrained Submodular Maximization include Max-Cut, Max-DiCut, and variants of Max-SAT and maximum facility location. We present a simple randomized linear time algorithm achieving a tight approximation guarantee of 1/2, thus matching the known hardness result of Feige, Mirrokni, and Vondrák [SIAM J. Comput., 40 (2011), pp. 1133-1153]. Our algorithm is based on an adaptation of the greedy approach which exploits certain symmetry properties of the problem.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)1384-1402
عدد الصفحات19
دوريةSIAM Journal on Computing
مستوى الصوت44
رقم الإصدار5
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2015

All Science Journal Classification (ASJC) codes

  • !!General Computer Science
  • !!General Mathematics

بصمة

أدرس بدقة موضوعات البحث “A tight linear time (1/2)-approximation for unconstrained submodular maximization'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا