Minimum Range Balanced Cuts via Dynamic Subset Sums
From MaRDI portal
Publication:4339009
DOI10.1006/jagm.1996.0841zbMath0874.68240MaRDI QIDQ4339009
Publication date: 10 November 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/6sd695gn
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Faster Pseudopolynomial Time Algorithms for Subset Sum, The balanced traveling salesman problem, Lexicographic balanced optimization problems, The quadratic balanced optimization problem