The Lam–Sethi worst-case analysis of the Coffman–Graham algorithm is set up to be partly incorrect. A slightly different context is set up to correct and ...

An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness · Computer Science. Ann. Oper. Res. · 1998.

A New Insight into the Coffman-Graham Algorithm. Braschi, Bertrand; Trystram, Denis. SIAM Journal on Computing; Philadelphia Vol. 23, Iss. 3, (Jun 1994): 8 ...

The Lam--Sethi worst-case analysis of the Coffman--Graham algorithm is set up to be partly incorrect. A slightly different context is set up to correct and ...

TL;DR: Analysis of performance properties of list scheduling algorithms under various dynamic assumptions and different levels of knowledge available for ...

Abstract: "The approximate solution of the m-machine problem is addressed. The Lam-Sethi worst-case analysis of the Coffman-Graham algorithm is shown to be ...

A New Insight into the Coffman–Graham Algorithm ; Society for Industrial and Applied Mathematics (SIAM). Worst Case Analysis of Two Scheduling Algorithms. Lam S.

The Coffman–Graham algorithm is an algorithm for arranging the elements of a partially ordered set into a sequence of levels.

Apr 25, 2024 · Bertrand Braschi, Denis Trystram: A New Insight into the Coffman-Graham Algorithm. SIAM J. Comput. 23(3): 662-669 (1994).

This paper describes new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. These algorithms are much ...