Finding the closest extreme vertex to a fixed point

DOI10.1016/0020-0190(92)90003-EzbMath0753.68096MaRDI QIDQ1199551

Gerhard J. Woeginger

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

lower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Bit serial addition trees and their applications
• Parallel sorting algorithms for tightly coupled multiprocessors
• The complexity of selection and ranking in X+Y and matrices with sorted columns

This page was built for publication: Finding the closest extreme vertex to a fixed point