Improved approximation algorithms for weighted 2-path partitions

Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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

Original languageEnglish
Title of host publicationAlgorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings
EditorsNikhil Bansal, Irene Finocchi
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783662483497
StatePublished - 2015
Externally publishedYes
Event23rd European Symposium on Algorithms, ESA 2015 - Patras, Greece
Duration: 14 Sep 201516 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference23rd European Symposium on Algorithms, ESA 2015

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.


This work is supported by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053, The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.

FundersFunder number
U.S. Army Research Laboratory
Army Research LaboratoryW911NF-09-2-0053


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

    Cite this