1976 in computing

algorithm that approximates solutions to the travellng salesman problem on a metric space, guaranteeing that its solutions will be within 1½ of the optimal solution length; discovered by Nicos Christofides in 1976

American computer programmer

class of algorithms in computational geometry that uses a conceptual sweep line/surface to solve various problems in Euclidean space