Linear-Time Algorithms for Proportional Apportionment

DOI10.1007/978-3-319-13075-0_46zbMath1432.91065arXiv1409.2603OpenAlexW1843442456MaRDI QIDQ2942662

David Eppstein, Zhanpeng Cheng

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.2603

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks

Cites Work

• Unnamed Item
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Rounding with multiplier methods: An efficient algorithm and applications in statistics
• Generalized Selection and Ranking: Sorted Matrices
• On Huntington Methods of Apportionment
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

This page was built for publication: Linear-Time Algorithms for Proportional Apportionment