A randomized approximation algorithm for metric triangle packing

Given an edge-weighted complete graph G on 3 n vertices, the maximum-weight triangle packing problem asks for a collection of n vertex-disjoint triangles in G such that the total weight of edges in these n triangles is maximized. Although the problem has been extensively studied in the literature, i...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 41; H. 1; S. 12 - 27
Hauptverfasser:	Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng, Zhang, An
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2021 Springer Nature B.V
Schlagworte:	Algorithms Apexes Approximation Combinatorics Convex and Discrete Geometry Graph theory Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Ratios Theory of Computation Weight Metric Maximum cycle cover Approximation algorithm Randomized algorithm Triangle packing
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!