An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs

10/06/2021
by   Seyedmohammadhossein Hosseinian, et al.
0

We present a (1+k/k+2)-approximation algorithm for the Maximum k-dependent Set problem on bipartite graphs for any k≥1. For a graph with n vertices and m edges, the algorithm runs in O(k m √(n)) time and improves upon the previously best-known approximation ratio of 1+k/k+1 established by Kumar et al. [Theoretical Computer Science, 526: 90–96 (2014)]. Our proof also indicates that the algorithm retains its approximation ratio when applied to the (more general) class of König-Egerváry graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/15/2019

A 2/3-Approximation Algorithm for Vertex-weighted Matching

We consider the maximum vertex-weighted matching problem (MVM) for non-b...
06/07/2021

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...
10/26/2018

Mining Maximal Induced Bicliques using Odd Cycle Transversals

Many common graph data mining tasks take the form of identifying dense s...
11/03/2018

Improved approximation algorithms for path vertex covers in regular graphs

Given a simple graph G = (V, E) and a constant integer k > 2, the k-path...
12/17/2019

Approximating MIS over equilateral B_1-VPG graphs

We present an approximation algorithm for the maximum independent set (M...
03/04/2019

Faster Biclique Mining in Near-Bipartite Graphs

Identifying dense bipartite subgraphs is a common graph data mining task...
10/02/2020

A Weight-scaling Algorithm for f-factors of Multigraphs

We discuss combinatorial algorithms for finding a maximum weight f-facto...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.