Approximation results for the weighted P4 partition problems

Authors:
Jérôme Monnot;Sophie Toulouse
Affiliations:
LAMSADE, CNRS UMR 7024, Université Paris Dauphine, Paris, France;Institut Galilée LIPN, CNRS UMR 7030, Université Paris 13, Villetaneuse, France
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 11
Cited 2

The traveling salesman problem with distances one and two

Mathematics of Operations Research
The complexity of approximating a nonlinear program

Mathematical Programming: Series A and B
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
An approximation algorithm for maximum packing of 3-edge paths

Information Processing Letters
P-Complete Approximation Problems

Journal of the ACM (JACM)
z-Approximations

Journal of Algorithms
Differential approximation results for the traveling salesman and related problems

Information Processing Letters
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the k-path partition of graphs

Theoretical Computer Science
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms

The Pk Partition Problem and Related Problems in Bipartite Graphs

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
The path partition problem and related problems in bipartite graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several new standard and differential approximation results for P4-partition problem by using the algorithm proposed in Hassin and Rubinstein (Information Processing Letters, 63: 63-67, 1997), for both minimization and maximization versions of the problem. However, the main point of this paper is the robustness of this algorithm, since it provides good solutions, whatever version of the problem we deal with, whatever the approximation framework within which we estimate its approximate solutions.