Approximation results for the weighted P4 partition problem

Authors:
Jérôme Monnot;Sophie Toulouse
Affiliations:
Université Paris Dauphine, CNRS LAMSADE, UMR 7024, 75016 Paris, France;Université Paris Dauphine, CNRS LAMSADE, UMR 7024, 75016 Paris, France
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 13
Cited 1

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
8/7-approximation algorithm for (1,2)-TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
An approximation algorithm for maximum triangle packing

Discrete Applied Mathematics
An improved approximation algorithm for TSP with distances one and two

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Differential approximation of the multiple stacks TSP

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several new standard and differential approximation results for the P"4-partition problem using the Hassin and Rubinstein algorithm [Information Processing Letters 63 (1997) 63-67]. Those results concern both minimization and maximization versions of the problem. However, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratios.