Independent Sets in Elimination Graphs with a Submodular Objective

by   Chandra Chekuri, et al.

Maximum weight independent set (MWIS) admits a 1/k-approximation in inductively k-independent graphs and a 1/2k-approximation in k-perfectly orientable graphs. These are a a parameterized class of graphs that generalize k-degenerate graphs, chordal graphs, and intersection graphs of various geometric shapes such as intervals, pseudo-disks, and several others. We consider a generalization of MWIS to a submodular objective. Given a graph G=(V,E) and a non-negative submodular function f: 2^V →ℝ_+, the goal is to approximately solve max_S ∈ℐ_G f(S) where ℐ_G is the set of independent sets of G. We obtain an Ω(1/k)-approximation for this problem in the two mentioned graph classes. The first approach is via the multilinear relaxation framework and a simple contention resolution scheme, and this results in a randomized algorithm with approximation ratio at least 1/e(k+1). This approach also yields parallel (or low-adaptivity) approximations. Motivated by the goal of designing efficient and deterministic algorithms, we describe two other algorithms for inductively k-independent graphs that are inspired by work on streaming algorithms: a preemptive greedy algorithm and a primal-dual algorithm. In addition to being simpler and faster, these algorithms, in the monotone submodular case, yield the first deterministic constant factor approximations for various special cases that have been previously considered such as intersection graphs of intervals, disks and pseudo-disks.


page 1

page 2

page 3

page 4


Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks

Intersection graphs of planar geometric objects such as intervals, disks...

Tight Algorithms for the Submodular Multiple Knapsack Problem

Submodular function maximization has been a central topic in the theoret...

Parallelizing greedy for submodular set function maximization in matroids and beyond

We consider parallel, or low adaptivity, algorithms for submodular funct...

Streaming algorithms for Budgeted k-Submodular Maximization problem

Stimulated by practical applications arising from viral marketing. This ...

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

Independent set is a fundamental problem in combinatorial optimization. ...

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs

We investigate a fundamental vertex-deletion problem called (Induced) Su...

Structured Region Graphs: Morphing EP into GBP

GBP and EP are two successful algorithms for approximate probabilistic i...

Please sign up or login with your details

Forgot password? Click here to reset