Is there a pairing technique for round robin fairness among duplicate values in a pairing heap?
Round Robin Fairness in Pairing Heaps with Duplicate Values Pairing heaps are an efficient data structure for implementing priority queues They offer fast inser