Partition median problem
Statement
Let P be the set of partitions of a ground set S. We allow two operations on P: (1) splitting a class into two arbitrary classes and (2) joining two classes into one. For two partitions X and Y, let us define the distance d(X,Y) as the minimum number of such operations transforming X to Y. Given partitions , find a partition in polyinomial time minimizing the total distance,
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.