Choosing Subsets with Maximum Weighted Average

DOI10.1006/JAGM.1996.0849MaRDI QIDQ4349704zbMATH OpenOpenAlexFDO

Authors David Eppstein, Daniel S. Hirschberg

Publication date 25 August 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0849

zbMATH Keywords

maximum weighted average

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 800169
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
• The problem of finding a subset of vectors with maximal total weight
• A Fast Approximation Algorithm For The Subset-Sum Problem

Cited in

(3)

• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• On Selecting a Subset Containing the Alternative with the Largest Priority
• Using sparsification for parametric minimum spanning tree problems

This page was built for publication: Choosing Subsets with Maximum Weighted Average

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