@inproceedings{344e8a4b10404239b70ff4528af22cfa,

title = "Improved approximation algorithms for weighted 2-path partitions",

abstract = "We investigate two NP-complete vertex partition problems on edge weighted complete graphs with 3k vertices. The first problem asks to partition the graph into k vertex disjoint paths of length 2 (referred to as 2-paths) such that the total weight of the paths is maximized. We present a cubic time approximation algorithm that computes a 2-path partition whose total weight is at least .5833 of the weight of an optimal partition; improving upon the (.5265 – ϵ)-approximation algorithm of [26]. Restricting the input graph to have edge weights in {0, 1}, we present a .75 approximation algorithm improving upon the .55-approximation algorithm of [16]. Combining this algorithm with a previously known approximation algorithm for the 3-Set Packing problem, we obtain a .6-approximation algorithm for the problem of partitioning a {0, 1}-edge-weighted graph into k vertex disjoint triangles of maximum total weight. The best known approximation algorithm for general weights achieves an approximation ratio of .5257 [4].",

author = "Amotz Bar-Noy and David Peleg and George Rabanca and Ivo Vigan",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 23rd European Symposium on Algorithms, ESA 2015 ; Conference date: 14-09-2015 Through 16-09-2015",

year = "2015",

doi = "https://doi.org/10.1007/978-3-662-48350-3_79",

language = "الإنجليزيّة",

isbn = "9783662483497",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "953--964",

editor = "Nikhil Bansal and Irene Finocchi",

booktitle = "Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings",

address = "ألمانيا",

}