graph LR
    idea_052db268_2e66_4fb4_a68e_28659509c378["Job Scheduling NP-Completeness in Computer Science"]
    idea_18e10ebc_909b_4dd7_bf27_44e882bec216["Greedy Approximation Algorithm for Set Cover Problem in NP-Complete Optimization"]
    idea_1ad98497_f7f4_48d5_9a1c_9632304ec8e7["Approximation Algorithms for NP Complete Problems in Design and Analysis of Algorithms"]
    idea_1efbd313_b4b2_4cbf_a699_ff1d41cac440["Fully Polynomial Time Approximation Scheme (FPTAS) for Knapsack Problem in Computer Science"]
    idea_20b9325a_f4ea_4cc0_9a26_92444a9ecc8c["NP-Completeness via Reduction from Vertex Cover on Bounded Degree Graphs"]
    idea_2361b4be_0bc8_4375_be83_5556d0fd9aeb["Average Case Analysis of Quicksort in Algorithm Design"]
    idea_29e891b8_8f02_4d9c_ad64_647cf788bc68["Algorithm Analysis in Computer Science Using Time and Space Complexity Criteria"]
    idea_2c771ad3_3dea_4c02_bba1_96736f9f55fd["Merge Sort Algorithm in Divide and Conquer using Binary Search"]
    idea_39c5abde_23c6_4cce_8717_9695bd3f5ed3["Greedy Algorithm Interval Partitioning by Starting Times to Minimize Parts"]
    idea_44fd5ffb_b61a_4ac5_b9e5_3c20a5dc3f90["Branch and Bound Combinatorial Optimization via Negative Cost Functions in Algorithms"]
    idea_53009532_15cc_4d96_95c8_36fcb231ddf1["Analysis Framework II: Random Access Machine Model in Design and Analysis of Algorithms"]
    idea_53fc20fd_a3d5_47ed_ab8c_7f9e481c4b64["Naive and Rabin-Karp Pattern Matching Algorithm in Computer Science"]
    idea_59736f7f_5c14_420d_8323_214998743b55["Element Distinctness Lower Bounds in Decision Tree Model"]
    idea_5d5d895c_bbfa_4da2_be94_a22ff1fe8e54["Longest Common Subsequence Dynamic Programming in Algorithms"]
    idea_6534f152_d8d2_4b32_aa13_e4707d6a35dd["Linear Time Median Finding Using Divide and Conquer in Algorithms"]
    idea_6e6b5447_1592_4a30_a7c3_a2d946e5c9ed["Methodology of mathematics"]
    idea_8398422d_56be_466e_84d8_13f19df54d10["Omega-n-log-n Lower Bound on Comparison-based Sorting Algorithms in Decision Trees"]
    idea_852d9cd4_fe4d_46ec_a742_6e37b48e7698["NP Completeness Reduction from Vertex Cover to Clique in Combinatorial Optimization"]
    idea_9089287b_efcb_4f39_b7de_73d4f5d55dfe["Fractional Knapsack Problem Greedy Algorithm Analysis in Computer Science"]
    idea_917d8ef6_fb1c_48f5_abb5_d66a07c1a1db["Input Output Relationship Analysis in Algorithms"]
    idea_96754657_796c_4fad_b28c_1897a39399e5["Sorting Lower Bounds Using Comparison Trees in Computer Science"]
    idea_9e73eda3_07d8_4828_96b2_b41dc2b9cf98["Algorithm Design Techniques: Finding Min and Second Minimum in Arrays using Divide and Conquer"]
    idea_9f586afc_88e0_4999_ae7a_f65b844ecba1["Lecture - 23 Bipartite Maximum Matching"]
    idea_aa2d5921_7df9_4aff_a072_2908850dcb6d["Lecture -20 Matric Chain Multiplication"]
    idea_b2744ed3_e408_4f8d_8688_a4addf62710e["Lecture - 21 Scheduling with Startup and Holding Costs"]
    idea_b9d7e902_1b5a_4352_85e8_cd6b71be8382["Maximum Independent Set on Trees using Greedy Algorithms"]
    idea_becdead7_8e1c_4919_8fe5_c9ffb027f2f8["KMP Algorithm: Computing Pattern Matching Failure Function (in English)"]
    idea_bf880c8a_0d73_42cd_865d_9a6ab0ebe367["Reductions Between Hamiltonian Cycle and Hamiltonian Path Problems in Graph Theory"]
    idea_d99ad25c_8a61_40aa_9500_b1c45ae485a2["Lecture -16 Combinational Search and Optimization I"]
    idea_e7ddf7fe_ea97_4fe8_95f3_df7c82dce350["Closest Pair Problem in Computational Geometry using Divide and Conquer Algorithm Design Technique"]
    idea_eb62b40e_f83e_4d55_87b0_d903fe94d65c["Knapsack Problem Optimization Using Dynamic Programming in Algorithm Design"]
    idea_f2812aef_0a7f_43a5_bb10_39d431737abf["NP Completeness Defined via Hamiltonian Cycle and Verifier Proof in Computer Science Theory"]
    idea_fb279416_c91b_4b3f_aa96_f2d0d8279005["Huffman Coding for Binary Trees using Frequency Minimization Greedy Algorithm in Computer Science"]
    idea_ff1ceb74_b1f6_4480_adb4_bd1527a8c19c["Asymptotic Notation in Algorithm Analysis"]
    idea_ffd519fc_39d9_4673_96c4_a725bcaa1ab0["NP-Completeness Proof via Subset Sum and Exact Cover Reductions in Computational Complexity Theory"]
    idea_6e6b5447_1592_4a30_a7c3_a2d946e5c9ed --> idea_29e891b8_8f02_4d9c_ad64_647cf788bc68
    idea_917d8ef6_fb1c_48f5_abb5_d66a07c1a1db --> idea_29e891b8_8f02_4d9c_ad64_647cf788bc68
    style idea_5d5d895c_bbfa_4da2_be94_a22ff1fe8e54 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_bf880c8a_0d73_42cd_865d_9a6ab0ebe367 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_9e73eda3_07d8_4828_96b2_b41dc2b9cf98 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_6534f152_d8d2_4b32_aa13_e4707d6a35dd fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_ffd519fc_39d9_4673_96c4_a725bcaa1ab0 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_6e6b5447_1592_4a30_a7c3_a2d946e5c9ed fill:#fef3c7,stroke:#f59e0b,color:#92400e
    style idea_aa2d5921_7df9_4aff_a072_2908850dcb6d fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_9f586afc_88e0_4999_ae7a_f65b844ecba1 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_20b9325a_f4ea_4cc0_9a26_92444a9ecc8c fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_1ad98497_f7f4_48d5_9a1c_9632304ec8e7 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_2c771ad3_3dea_4c02_bba1_96736f9f55fd fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_852d9cd4_fe4d_46ec_a742_6e37b48e7698 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_052db268_2e66_4fb4_a68e_28659509c378 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_2361b4be_0bc8_4375_be83_5556d0fd9aeb fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_8398422d_56be_466e_84d8_13f19df54d10 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_b2744ed3_e408_4f8d_8688_a4addf62710e fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_f2812aef_0a7f_43a5_bb10_39d431737abf fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_917d8ef6_fb1c_48f5_abb5_d66a07c1a1db fill:#fef3c7,stroke:#f59e0b,color:#92400e
    style idea_d99ad25c_8a61_40aa_9500_b1c45ae485a2 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_53009532_15cc_4d96_95c8_36fcb231ddf1 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_fb279416_c91b_4b3f_aa96_f2d0d8279005 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_eb62b40e_f83e_4d55_87b0_d903fe94d65c fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_b9d7e902_1b5a_4352_85e8_cd6b71be8382 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_1efbd313_b4b2_4cbf_a699_ff1d41cac440 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_e7ddf7fe_ea97_4fe8_95f3_df7c82dce350 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_44fd5ffb_b61a_4ac5_b9e5_3c20a5dc3f90 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_39c5abde_23c6_4cce_8717_9695bd3f5ed3 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_29e891b8_8f02_4d9c_ad64_647cf788bc68 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_59736f7f_5c14_420d_8323_214998743b55 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_18e10ebc_909b_4dd7_bf27_44e882bec216 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_ff1ceb74_b1f6_4480_adb4_bd1527a8c19c fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_53fc20fd_a3d5_47ed_ab8c_7f9e481c4b64 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_9089287b_efcb_4f39_b7de_73d4f5d55dfe fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_becdead7_8e1c_4919_8fe5_c9ffb027f2f8 fill:#e5e7eb,stroke:#9ca3af,color:#374151
    style idea_96754657_796c_4fad_b28c_1897a39399e5 fill:#e5e7eb,stroke:#9ca3af,color:#374151