{"id":19787359,"url":"https://github.com/adriacabeza/complexalgorithms","last_synced_at":"2025-04-30T23:33:24.693Z","repository":{"id":122837741,"uuid":"294232993","full_name":"adriacabeza/ComplexAlgorithms","owner":"adriacabeza","description":"🧙🏾‍♂️ Complex Algorithms and Complexity Course from the University of San Diego","archived":false,"fork":false,"pushed_at":"2020-11-08T20:06:34.000Z","size":8149,"stargazers_count":3,"open_issues_count":0,"forks_count":2,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-07-31T20:49:15.243Z","etag":null,"topics":["algorithm","complexity","flow-networks","linear-programming","np-completeness","python3","streaming-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/adriacabeza.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-09-09T21:24:23.000Z","updated_at":"2024-04-26T13:59:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"e7a29339-8955-44a2-92d9-02f7ee3092d0","html_url":"https://github.com/adriacabeza/ComplexAlgorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adriacabeza%2FComplexAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adriacabeza%2FComplexAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adriacabeza%2FComplexAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adriacabeza%2FComplexAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/adriacabeza","download_url":"https://codeload.github.com/adriacabeza/ComplexAlgorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224227227,"owners_count":17276759,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","complexity","flow-networks","linear-programming","np-completeness","python3","streaming-algorithms"],"created_at":"2024-11-12T06:22:36.732Z","updated_at":"2024-11-12T06:22:37.353Z","avatar_url":"https://github.com/adriacabeza.png","language":"Python","readme":"# Advanced Algorithms and Complexity Course\nThis repository contains some of the problem assignments from the Advanced Algorithms and Complexity Course from the University of San Diego.\n\n- [Flows in Networks](./1-Flows-In-Network): \n    - **Evacuation**: Applying an algorithm for finding maximum flow in a network to determine how fast people can be evacuated from the given city.\n    - **Airline Crew**: Applying an algorithm for finding maximum matching in a bipartite graph to assign airline crews to flights in the most efficient way.\n    - **Stock Charts**: Applying a flow algorithm approach to find the minimum Path Cover in a DAG to compute the maximum number of stock charts that do not intersect.\n- [Linear Programming](./2-Linear-Programming):\n    - **Energy values**: Applying Gaussian elimination to solve a problem where we have to tell the amount of nutrients that each ingredient has.\n    - **Diet**: Applying Gaussian elimination to perform a brute force linear programming approach\n- [NP-Completeness](./3-NP-completeness):\n    - **GSM Network**: encoding to SAT the 3-coloring problem to determine if we can make a GSM network work\n    - **Cleaning the apartment**: encoding to SAT the Hamiltonian Path problem to find a a clever way to clean your apartment\n- [Coping with NP-completeness](./4-Coping-with-NP-completeness):\n    - **Integrated Circuit Design**: solving 2-SAT by constructing a directed implications graph and looking for different strongly connected components to design part of an integrated circuit\n    - **Plan a Fun Party**: computing maximum independent set of a tree to plan a fun party\n- [Streaming Algorithms](./5-Streaming-Algorithms):\n    - **Nice vs Naughty**: implementing the count sketch algorithm to determine if a kid was nice or naughty to help Santa Claus.\n\nCertificate:\n\n\u003cimg src=\"./certificate.png\" width=\"80%\"/\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadriacabeza%2Fcomplexalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fadriacabeza%2Fcomplexalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fadriacabeza%2Fcomplexalgorithms/lists"}