- Published 2013 in 2013 IEEE International Symposium on Parallel…
DOI:10.1109/IPDPSW.2013.54

The Deep Greedy Switching algorithm is a fast heuristic for solving large instances of the linear sum assignment problem whilst sacrificing very little in terms of optimality. In this paper we explore the worst case performance aspects of the algorithm. We prove that the algorithm is finite and analyze its computational complexity. We also discuss a number… CONTINUE READING

### Presentations referencing similar topics