Strong Colorings of Hypergraphs

A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. We then consider various parameters that make coloring easier, and give a unified treatment. In particular, we give an algebraic scheme using integer programming to color graphs of bounded composition-width.

[1]  A. F. Adams,et al.  The Survey , 2021, Dyslexia in Higher Education.

[2]  László Lovász.  On decomposition of graphs , 1966 .

[3]  A. Hajnal,et al.  On decomposition of graphs , 1967 .

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

[5]  S. Thomas McCormick,et al.  Optimal approximation of sparse hessians and its equivalence to a graph coloring problem , 1983, Math. Program..

[6]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[7]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[8]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[9]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[10]  Takao Nishizeki,et al.  On the 1.1 Edge-Coloring of Multigraphs , 1990, SIAM J. Discret. Math..

[11]  Magnús M. Halldórsson,et al.  Lower Bounds for On-line Graph Coloring , 1991, On-Line Algorithms.

[12]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[13]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[14]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

[15]  M. Halldórsson.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Inf. Process. Lett..

[16]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[17]  Rajeev Motwani,et al.  Computing Roots of Graphs Is Hard , 1994, Discret. Appl. Math..

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

[19]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[20]  M. Halldórsson.  Approximations via partitioning , 1995 .

[21]  Jeff Kahn,et al.  Asymptotically Good List-Colorings , 1996, J. Comb. Theory A.

[22]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[23]  Hoong Chuin Lau,et al.  Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , 1997, J. Graph Algorithms Appl..

[24]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[25]  Benny Sudakov,et al.  Approximate Coloring of Uniform Hypergraphs (Extended Abstract) , 1998, ESA.

[26]  Ralf Fröberg,et al.  An introduction to Gröbner bases , 1997, Pure and applied mathematics.

[27]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[28]  Jan Kratochvíl,et al.  Independent Sets with Domination Constraints , 1998, Discret. Appl. Math..

[29]  Magnús M. Halldórsson.  Online coloring known graphs , 1999, SODA '99.

[30]  Magnús M. Halldórsson,et al.  Coloring powers of planar graphs , 2000, SODA '00.

[31]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[32]  Michael Molloy,et al.  Near optimal list colorings , 2000 .

[33]  M. Halldórsson,et al.  On Powers of Chordal Graphs And Their Colorings , 2000 .

[34]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[35]  Öjvind Johansson,et al.  Graph Decomposition Using Node Labels , 2001 .

[36]  Rajeev Raman,et al.  Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.

[37]  Mohammad R. Salavatipour,et al.  Frequency Channel Assignment on Planar Networks , 2002, ESA.

[38]  Udi Rotics,et al.  Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..

[39]  Oded Schwartz,et al.  On the Hardness of Approximating k-Dimensional Matching , 2003, Electron. Colloquium Comput. Complex..

[40]  Magnús M. Halldórsson,et al.  Proper Down-Coloring Simple Acyclic Digraphs , 2003, AGTIVE.

[41]  Oded Schwartz,et al.  On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.

[42]  Benny Sudakov,et al.  Approximate coloring of uniform hypergraphs , 1998, J. Algorithms.

[43]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance , 2004, Lecture Notes in Computer Science.

[44]  Vangelis Th. Paschos,et al.  Polynomial Approximation and Graph-Coloring , 2003, Computing.

[45]  Sandy Irani.  Coloring inductive graphs on-line , 2005, Algorithmica.

[46]  F. Clarke.  On _{_{*}()}(_{*}(), _{*}()) , 1979 .