Approximation and Online Algorithms
From MaRDI portal
Publication:5713442
DOI10.1007/b106130zbMath1124.05316MaRDI QIDQ5713442
Magnús M. Halldórsson, Geir Agnarsson
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
68W25: Approximation algorithms
Related Items
Subdivision of hypergraphs and their colorings, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Flexible coloring, Zero-free intervals of chromatic polynomials of hypergraphs, Relating hypergraph parameters of generalized power graphs, Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra, Concepts on coloring of cluster hypergraphs with application, Complete colourings of hypergraphs, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree