Approximation results for the weighted P4 partition problems

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 388-396

  Monnot, Jérôme ^a   Toulouse, Sophie ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

3 length chain; Approximation algorithms; Differential approximation; Graph partition; Performance ratio; Standard approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY;

APPROXIMATE SOLUTIONS; DIFFERENTIAL APPROXIMATION;

COMPUTER SCIENCE;

EID: 26844486284     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_34     Document Type: Conference Paper

References (14)

1. Arkin, E. M., Hassin, R. and Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. of Algorithms, (article in press)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.:Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties). Springer, Berlin (1999)
3. Ausiello, G., D'Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. System Sci. 21 (1980) 136-153
4. Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Mathematical Programming 69 (1995) 429-441
5. Demange, M., Paschos, V. Th.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science 158 (1996) 117-141
6. Frederickson, G. N., Hecht, M. S., Kim, C. E.: Approximation algorithms for some routing problems. SIAM J. on Computing 7 (1978) 178-193
7. Garey, M. R., Johnson, D. S.: Computers and intractability, a guide to the theory of NP-completeness. CA, Freeman (1979)
8. Hassin, R., Khuller, S.: z-approximations. Journal of Algorithms 41 (2001) 429-442
9. Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Information Processing Letters 63 (1997) 63-67
10. Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Triangle Packing. ESA, LNCS 3221 (2004) 403-413
11. Monnot, J.: Differential approximation results for the traveling salesman and related problems. Information Processing Letters 82 (2002) 229-235
12. Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993) 1-11
13. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the Association for Computing Machinery 23 (1976) 555-565
14. Steiner, G.: On the k-path partition of graphs. Theoretical Computer Science 290 (2003) 2147-2155