A 2/3-approximation algorithm for vertex-weighted matching

We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs in which non-negative weights are assigned to the vertices of a graph and a matching that maximizes the sum of the weights of the matched vertices is desired. In earlier work we have described a 2/3-approximation...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2022-02, Vol.308 (C), p.46-67
Hauptverfasser:	Al-Herz, Ahmed, Pothen, Alex
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Approximation Approximation algorithm Augmenting path Graph matching Graph theory Graphs Heaviest unmatched neighbor Mathematical analysis Vertex-weighted matching Weight-increasing path
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!