A linear selection algorithm for sets of elements with weights

DOI10.1016/0020-0190(78)90083-2zbMath0384.68064OpenAlexW2049524417MaRDI QIDQ1249045

Angelika Reiser

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90083-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items

The Kantorovich metric for probability measures on the circle ⋮ The (1|1)-Centroid Problem in the Plane with Distance Constraints ⋮ A linear time algorithm for a matching problem on the circle ⋮ Weighted median algorithms for \(L_ 1\) approximation ⋮ NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A class of simplicial restart fixed point algorithms without an extra dimension

Cites Work

• Time bounds for selection
• Unnamed Item