DeepAI AI Chat
Log In Sign Up

A local search 4/3-approximation algorithm for the minimum 3-path partition problem

by   Yong Chen, et al.
Xiamen University
University of Alberta
Georgia Southern University
Hangzhou Dianzi University

Given a graph G = (V, E), the 3-path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most 3 to cover all the vertices of V. It is different from but closely related to the well-known 3-set cover problem. The best known approximation algorithm for the 3-path partition problem was proposed recently and has a ratio 13/9. Here we present a local search algorithm and show, by an amortized analysis, that it is a 4/3-approximation. This ratio matches up to the best approximation ratio for the 3-set cover problem.


page 1

page 2

page 3

page 4


Approximation algorithms for the directed path partition problems

Given a directed graph G = (V, E), the k-path partition problem is to fi...

Enhancing Balanced Graph Edge Partition with Effective Local Search

Graph partition is a key component to achieve workload balance and reduc...

A Local Search-Based Approach for Set Covering

In the Set Cover problem, we are given a set system with each set having...

Rectangle Transformation Problem

In this paper, we propose the rectangle transformation problem (RTP) and...

Additive Pattern Database Heuristics

We explore a method for computing admissible heuristic evaluation functi...

Improved approximation algorithms for path vertex covers in regular graphs

Given a simple graph G = (V, E) and a constant integer k > 2, the k-path...

Isometric path antichain covers: beyond hyperbolic graphs

The isometric path antichain cover number of a graph G, denoted by ipacc...