McDiarmid Colin

Colin McDiarmid

Information about the author Colin McDiarmid will soon be added to the site.
Found 6 papers in total
Uniform multicommodity flow through the complete graph with random edge-capacities
Uniform multicommodity flow through the complete graph with random edge-capacities
2009
Give random capacities C to the edges of the complete n -vertex graph. Consider the...
Channel assignment with large demands
Channel assignment with large demands
2001
We introduce a general static model for radio channel assignment, the ‘feasible...
Channel assignment and weighted coloring
Channel assignment and weighted coloring
2000
In cellular telephone networks, set of radio channels (colors) must be assigned to...
Pattern minimisation in cutting stock problems
Pattern minimisation in cutting stock problems
1999
In the cutting stock pattern minimisation problem, we wish to satisfy demand for...
The complexity of harmonious colouring for trees
The complexity of harmonious colouring for trees
1995
A harmonious colouring of a simple graph G is a proper vertex colouring such that each...
On the improvement per iteration in Karmarkar’s algorithm for linear programming
On the improvement per iteration in Karmarkar’s algorithm for linear programming
1990
We investigate the decrease in potential at an iteration of Karmarkar’s...
Papers per page: