Skip to main navigation Skip to search Skip to main content

Improved approximation algorithms for weighted 2-path partitions

Research output: Contribution to conference › Paper › peer-review

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]. Springer-Verlag Berlin Heidelberg 2015.
Original languageEnglish
Pages953-964
DOIs
StatePublished - 2015
Event23rd European Symposium on Algorithms, ESA 2015 -
Duration: 1 Sep 2015 → 1 Sep 2015

Conference

Conference23rd European Symposium on Algorithms, ESA 2015
Period1/09/15 → 1/09/15

Fingerprint

Dive into the research topics of 'Improved approximation algorithms for weighted 2-path partitions'. Together they form a unique fingerprint.

Cite this