Reconfiguration Problems on Submodular Functions

11/28/2021
by   Naoto Ohsaka, et al.
0

Reconfiguration problems require finding a step-by-step transformation between a pair of feasible solutions for a particular problem. The primary concern in Theoretical Computer Science has been revealing their computational complexity for classical problems. This paper presents an initial study on reconfiguration problems derived from a submodular function, which has more of a flavor of Data Mining. Our submodular reconfiguration problems request to find a solution sequence connecting two input solutions such that each solution has an objective value above a threshold in a submodular function f: 2^[n]→ℝ_+ and is obtained from the previous one by applying a simple transformation rule. We formulate three reconfiguration problems: Monotone Submodular Reconfiguration (MSReco), which applies to influence maximization, and two versions of Unconstrained Submodular Reconfiguration (USReco), which apply to determinantal point processes. Our contributions are summarized as follows: 1. We prove that MSReco and USReco are both 𝖯𝖲𝖯𝖠𝖢𝖤-complete. 2. We design a 1/2-approximation algorithm for MSReco and a 1/n-approximation algorithm for (one version of) USReco. 3. We devise inapproximability results that approximating the optimum value of MSReco within a (1-1+ϵ/n^2)-factor is 𝖯𝖲𝖯𝖠𝖢𝖤-hard, and we cannot find a (5/6+ϵ)-approximation for USReco. 4. We conduct numerical study on the reconfiguration version of influence maximization and determinantal point processes using real-world social network and movie rating data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2023

Fast algorithms for k-submodular maximization subject to a matroid constraint

In this paper, we apply a Threshold-Decreasing Algorithm to maximize k-s...
research
07/15/2021

Multilinear extension of k-submodular functions

A k-submodular function is a function that given k disjoint subsets outp...
research
07/27/2019

Improved randomized algorithm for k-submodular function maximization

Submodularity is one of the most important properties in combinatorial o...
research
06/28/2020

Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints

The problem of maximizing nonnegative monotone submodular functions unde...
research
07/25/2018

Efficient algorithms for robust submodular maximization under matroid constraints

In this work, we consider robust submodular maximization with matroid co...
research
10/14/2018

Incorporating Diversity into Influential Node Mining

Diversity is a crucial criterion in many ranking and mining tasks. In th...
research
02/28/2017

Robust Budget Allocation via Continuous Submodular Functions

The optimal allocation of resources for maximizing influence, spread of ...

Please sign up or login with your details

Forgot password? Click here to reset