Distribution-sensitive set multi-partitioning
2005 ◽
Vol DMTCS Proceedings vol. AD,...
(Proceedings)
◽
Keyword(s):
International audience Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence of the members of $\mathcal{S}$ such that if $x,y \in \mathcal{S}$ have different types and $x < y$, $x$ precedes $y$ in the multi-partitioning of $\mathcal{S}$. We give two distribution-sensitive algorithms for the set multi-partitioning problem and a matching lower bound in the algebraic decision-tree model. One of the two algorithms can be made stable and can be implemented in place. We also give an output-sensitive algorithm for the problem.
2017 ◽
Vol 2017
◽
pp. 1-6
◽
Keyword(s):
1993 ◽
Vol 28
(10)
◽
pp. 997-1014
◽
Keyword(s):