Efficient algorithm for near-optimal edge-colourings of hypergraphs Posted by Niel de Beaudrap, at cstheory.stackexchange.com, 06 Sep 2010 Graph colouring problems are, already, hard enough for most people. Even so, I'm going to have to be difficult and ask a…