Power balance and apportionment algorithms for the United States Congress
From MaRDI portal
Publication:5463374
DOI10.1145/297096.297106zbMath1073.68905MaRDI QIDQ5463374
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/
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On conceptually simple algorithms for variants of online bipartite matching, Greedy matching: guarantees and limitations, Parallel algorithms for bipartite matching problems on distributed memory computers, Multicast Routing and Design of Sparse Connectors
