The goal is to explore a deterministic algorithm that outperforms the greedy method for online edge coloring in bipartite graphs. This algorithm achieves a competitive ratio better than 2 for large ...

This paper analyzes a heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal unit cost as large as possible. Recursive necessary and ...