Distribution-sensitive set multi-partitioning - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Distribution-sensitive set multi-partitioning

Résumé

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.
Fichier principal
Vignette du fichier
dmAD0132.pdf (70.99 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184216 , version 1 (13-08-2015)

Identifiants

Citer

Amr Elmasry. Distribution-sensitive set multi-partitioning. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.353-356, ⟨10.46298/dmtcs.3381⟩. ⟨hal-01184216⟩

Collections

TDS-MACS
38 Consultations
481 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More