The Complexity of Maximum k-Order Bounded Component Set Problem

11/29/2017
by   Sounaka Mishra, et al.
0

Given a graph G=(V, E) and a positive integer k, in Maximum k-Order Bounded Component Set (Max-k-OBCS), it is required to find a vertex set S ⊆ V of maximum size such that each component in the induced graph G[S] has at most k vertices. We prove that for constant k, Max-k-OBCS is hard to approximate within a factor of n^1 -ϵ, for any ϵ > 0, unless P = NP. This is an improvement on the previous lower bound of √(n) for Max-2-OBCS due to Orlovich et al. We provide lower bounds on the approximability when k is not a constant as well. Max-k-OBCS can be seen as a generalization of Maximum Independent Set (Max-IS). We generalize Turán's greedy algorithm for Max-IS and prove that it approximates Max-k-OBCS within a factor of (2k - 1)d + k, where d is the average degree of the input graph G. This approximation factor is a generalization of Turán's approximation factor for Max-IS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2017

The Complexity of Maximum k-Order Bounded Component Set Proble

Given a graph G=(V, E) and a positive integer k, in Maximum k-Order Boun...
research
08/08/2023

On the concentration of the maximum degree in the duplication-divergence models

We present a rigorous and precise analysis of the maximum degree and the...
research
07/18/2019

A Constant Factor Approximation for Capacitated Min-Max Tree Cover

Given a graph G=(V,E) with non-negative real edge lengths and an integer...
research
07/18/2018

The parameterised complexity of computing the maximum modularity of a graph

The maximum modularity of a graph is a parameter widely used to describe...
research
03/18/2019

The Norms of Graph Spanners

A t-spanner of a graph G is a subgraph H in which all distances are pres...
research
04/20/2021

Upper and Lower Bounds for Deterministic Approximate Objects

Relaxing the sequential specification of shared objects has been propose...
research
07/25/2022

On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies

This paper considers the problem of constructing a confidence sequence f...

Please sign up or login with your details

Forgot password? Click here to reset