S. Hosseinian

collaborators

2 papers

math.CO2021

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

Seyedmohammadhossein Hosseinian, Sergiy Butenko

We present a $(1 + \frac{k}{k + 2})$ -approximation algorithm for the Maximum $k$ -dependent Set problem on bipartite graphs for any $k \geq 1$ . For a graph with $n$ vertices and $m$ edges,…

math.OC2019

Polyhedral Properties of the Induced Cluster Subgraphs

Seyedmohammadhossein Hosseinian, Sergiy Butenko

A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$ , a subset of vertices inducing a cluster graph is called an inde…

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

Polyhedral Properties of the Induced Cluster Subgraphs

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