A linear selection algorithm for sets of elements with weights

DOI10.1016/0020-0190(78)90083-2zbMATH Open0384.68064OpenAlexW2049524417MaRDI QIDQ1249045FDOQ1249045

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Time bounds for selection

Cited In (7)

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

This page was built for publication: A linear selection algorithm for sets of elements with weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249045)