Class KaplanZwickMaxRandomInsert

java.lang.Object
org.drip.sample.softheap.KaplanZwickMaxRandomInsert

public class KaplanZwickMaxRandomInsert
extends java.lang.Object
KaplanZwickMaxRandomInsert illustrates the Random Insert Operation for a Max Soft Heap as described in Kaplan and Zwick (2009). The References are:

  • Chazelle, B. (2000): The Discrepancy Method: Randomness and Complexity https://www.cs.princeton.edu/~chazelle/pubs/book.pdf
  • Chazelle, B. (2000): The Soft Heap: An Approximate Priority Queue with Optimal Error Rate Journal of the Association for Computing Machinery 47 (6) 1012-1027
  • Chazelle, B. (2000): A Minimum Spanning Tree Algorithm with Inverse-Ackerman Type Complexity Journal of the Association for Computing Machinery 47 (6) 1028-1047
  • Kaplan, H., and U. Zwick (2009): A simpler implementation and analysis of Chazelle's Soft Heaps https://epubs.siam.org/doi/abs/10.1137/1.9781611973068.53?mobileUi=0
  • Pettie, S., and V. Ramachandran (2008): Randomized Minimum Spanning Tree Algorithms using Exponentially Fewer Random Bits ACM Transactions on Algorithms 4 (1) 1-27




Author:
Lakshmi Krishnamurthy
  • Constructor Summary

    Constructors
    Constructor Description
    KaplanZwickMaxRandomInsert()  
  • Method Summary

    Modifier and Type Method Description
    static void main​(java.lang.String[] argumentArray)
    Entry Point

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Constructor Details

    • KaplanZwickMaxRandomInsert

      public KaplanZwickMaxRandomInsert()
  • Method Details

    • main

      public static final void main​(java.lang.String[] argumentArray) throws java.lang.Exception
      Entry Point
      Parameters:
      argumentArray - Command Line Argument Array
      Throws:
      java.lang.Exception - Thrown on Error/Exception Situation