A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
From MaRDI portal
Publication:4190436
DOI10.1145/322108.322114zbMath0404.90062OpenAlexW2070218576MaRDI QIDQ4190436
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322108.322114
Related Items (16)
L-infinity interdistance selection by parametric search ⋮ Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ Linear-Time Algorithms for Proportional Apportionment ⋮ Algorithms for the item assortment problem: an application to vending machine products ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ The complexity of selection and ranking in X+Y and matrices with sorted columns ⋮ A polynomial algorithm for resourse allocation problems with polymatroid constrains1 ⋮ On a general network location--production--allocation problem ⋮ A faster algorithm for the resource allocation problem with convex cost functions ⋮ An algorithm for a separable integer programming problem with cumulatively bounded variables ⋮ Optimal binary trees with order constraints ⋮ The Maximum Coverage Location Problem ⋮ An efficient algorithm for the parametric resource allocation problem ⋮ Discrete resource allocation with tree constraints by an incremental method ⋮ An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
This page was built for publication: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
