Applications of Discrepancy Theory in Multiobjective Approximation

We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.

[1]  Bodo Manthey,et al.  Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One , 2005, Algorithmica.

[2]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[3]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Bodo Manthey,et al.  On Approximating Multi-Criteria TSP , 2007, STACS.

[6]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[7]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[8]  David P. Williamson,et al.  Improved approximation algorithms for MAX SAT , 2000, SODA '00.

[9]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[10]  Bodo Manthey.  On Approximating Restricted Cycle Covers , 2005, WAOA.

[11]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[12]  Aleksander Madry,et al.  A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem , 2008, APPROX-RANDOM.

[13]  Bodo Manthey,et al.  Approximation Algorithms for Multi-criteria Traveling Salesman Problems , 2006, WAOA.

[14]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[15]  Concha Bielza,et al.  Mining probabilistic models learned by EDAs in the optimization of multi-objective problems , 2009, GECCO.

[16]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[17]  Bodo Manthey,et al.  Deterministic Algorithms for Multi-criteria TSP , 2011, TAMC.

[18]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[19]  Anand Srivastav,et al.  Multicolour Discrepancies , 2003, Comb. Probab. Comput..

[20]  Laurence A. Wolsey,et al.  An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit , 1979, Oper. Res..