now.net

Approximate diameter

Also known as Double sweep diameter. This is the canonical page; those names redirect here.

Kept distinct from graphs-structure's 'Double-BFS diameter': the same double-sweep idea is exact on trees and only approximate on general graphs, so the two are rivals under the graph-diameter problem rather than one entry.

Pairings in the atlas

Rivals: other methods for the same problems

Where it sits

approximation · Optimization & Operations Research