Complex sentence: An O (\\ log n)-approximation algorithm was developed by Khan et al that runs in O (D + L\\ times\\ log n) time, where L is the local shortest path diameter of the graph.
Split into simpler sentences: An O (\\ log n)-approximation algorithm was developed by Khan et al. This algorithm runs in O (D + L\\ times\\ log n) time, where L is the local shortest path diameter of the graph.