Tag Archives: greedy algorithm

Matroids and polymatroids

Jack Edmonds’ LTCC intensive course is now over. It differed in several respects from what was advertised. First, he shared the presentation with Alex Fink on a roughly equal basis; second, bimatrix games were shelved in favour of some exciting … Continue reading

Posted in events, exposition | Tagged , , , , , , , , | 2 Comments

A thrifty algorithm

Two important classical parameters of a permutation group G of degree n are the base size, the smallest size of a collection of points whose pointwise stabiliser is the identity; and the minimal degree, the smallest number of points moved … Continue reading

Posted in exposition, open problems | Tagged , , , , , | 4 Comments