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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 41; číslo 1; s. 12 - 27
Hlavní autoři:	Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng, Zhang, An
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!