A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization

Abstract

We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this problem is NP-hard and requires exponential complexity to solve in general, we have formulated a weaker version of this NP-hard problem, where the goal is to find a locally optimal solution. The local optimality considered in our work is under any swap between the opposing partitions' element pairs. To this end, we designed an algorithm which can produce such a locally optimal solution in $O(N^2)$ time and $O(N)$ space. Our approach does not require positive or integer inputs and works equally well under arbitrary input precisions. Thus, it is widely applicable in different problem scenarios.

References in corpus (6)

• Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
• Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics
• A Generalized Online Algorithm for Translation and Scale Invariant Prediction with Expert Advice
• Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Error
• Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles
• Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection