Approximation and Online Algorithms
From MaRDI portal
Publication:5713442
DOI10.1007/b106130zbMath1124.05316OpenAlexW4299357393MaRDI 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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Related Items
Subdivision of hypergraphs and their colorings, Concepts on coloring of cluster hypergraphs with application, Flexible coloring, Zero-free intervals of chromatic polynomials of hypergraphs, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, Complete colourings of hypergraphs, Relating hypergraph parameters of generalized power graphs, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra