Conversion of coloring algorithms into maximum weight independent set algorithms

A general technique for converting approximation algorithms for the vertex coloring problem in a class of graphs into approximation algorithms for the maximum weight independent set problem (MWIS) in the same class of graphs is presented. The technique consists of solving an LP-relaxation of the MWIS problem with certain clique inequalities, constructing an instance of the vertex coloring problem from the LP solution, applying the coloring algorithm to this instance, and selecting the best resulting color class as the MWIS solution. The approximation ratio obtained is the product of the approximation ratio with which the LP formulation can be solved (usually equal to one) and the approximation ratio of the coloring algorithm with respect to the size of the largest relevant clique. Applying this technique, the best known approximation algorithms are obtained for the maximum weight edge-disjoint paths problem in bidirected trees and in bidirected two-dimensional meshes with row-column routing, and for time-constrained scheduling of weighted packets in the same topologies. These problems are also proved to be MAX SNP-hard.

[1]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[2]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[3]  Klaus Jansen,et al.  Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees , 2002, JEAL.

[4]  Piotr Berman,et al.  On the Approximation Properties of Independent Set Problem in Degree 3 Graphs , 1995, WADS.

[5]  Magnús M. Halldórsson,et al.  Approximations of Independent Sets in Graphs , 1998, APPROX.

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

[7]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[8]  Karen Aardal,et al.  An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling , 1999, ESA.

[9]  Sudipto Guha,et al.  Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.

[10]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[11]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[12]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[13]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[14]  Martin Charles Golumbic,et al.  Edge and vertex intersection of paths in a tree , 1985, Discret. Math..

[15]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[16]  Klaus Jansen,et al.  Maximizing the Number of Connections in Optical Tree Networks , 1998, ISAAC.

[17]  Frits C. R. Spieksma,et al.  Approximating an Interval Scheduling Problem , 1998, APPROX.

[18]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[19]  Thomas Erlebach.  Scheduling connections in fast networks , 1999 .

[20]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[21]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[22]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[23]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[24]  Klaus Jansen,et al.  The Maximum Edge-Disjoint Paths Problem in Bidirected Trees , 2001, SIAM J. Discret. Math..

[25]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[26]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[27]  Spyros Tragoudas,et al.  Maximum weighted independent sets on transitive graphs and applications1 , 1999, Integr..

[28]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[29]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[30]  Piotr Berman,et al.  Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..

[31]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 1998, SPAA.

[32]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[33]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[34]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[35]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..