We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs in which non-negative weights are assigned to vertices of a graph and that maximizes sum matched is desired. In earlier work we have described 2/3-approximation algorithm MVM on bipartite (Florin Dobrian et al., 2019). Here show can be obtained by restricting length augmenting paths at most three. The has ti...

The Correlation Clustering Problem (CorCP) is a significant clustering problem based on the similarity of data. It has applications in different fields, such as machine learning, biology, and data mining, many problems other areas. In this paper, Balanced 2-CorCP (B2-CorCP) introduced examined, new interesting variant CorCP described. goal to partition vertex set into two clusters with equal si...