Power balance and apportionment algorithms for the United States Congress

DOI10.1145/297096.297106zbMath1073.68905OpenAlexW1984859821MaRDI QIDQ5463374

Jakob Magun

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/1998/MagunGreedy/

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ An Experimental Study of Algorithms for Online Bipartite Matching ⋮ Unnamed Item ⋮ Greedy matching: guarantees and limitations ⋮ Parallel algorithms for bipartite matching problems on distributed memory computers ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Multicast Routing and Design of Sparse Connectors

This page was built for publication: Power balance and apportionment algorithms for the United States Congress