Minimum Range Balanced Cuts via Dynamic Subset Sums
From MaRDI portal
Publication:4339009
DOI10.1006/jagm.1996.0841zbMath0874.68240OpenAlexW1984863471MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (4)
The balanced traveling salesman problem ⋮ Lexicographic balanced optimization problems ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ The quadratic balanced optimization problem
This page was built for publication: Minimum Range Balanced Cuts via Dynamic Subset Sums
