Minimum Range Balanced Cuts via Dynamic Subset Sums

DOI10.1006/JAGM.1996.0841MaRDI QIDQ4339009zbMATH OpenOpenAlexFDO

Authors David Eppstein

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

zbMATH Keywords

minimum range balanced cuts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for minimum range cut problems
• Minimum cuts in near-linear time
• scientific article; zbMATH DE number 1256719
• Most balanced minimum cuts

Cited in

(5)

• Lexicographic balanced optimization problems
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• The balanced traveling salesman problem
• Fully-dynamic min-cut
• The quadratic balanced optimization problem

This page was built for publication: Minimum Range Balanced Cuts via Dynamic Subset Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339009)