{"id":21325883,"url":"https://github.com/maxkapur/collegeapplication","last_synced_at":"2026-03-19T19:54:57.644Z","repository":{"id":38321282,"uuid":"486078452","full_name":"maxkapur/CollegeApplication","owner":"maxkapur","description":"The optimal college application problem (MS thesis and slides)","archived":false,"fork":false,"pushed_at":"2023-03-31T19:36:44.000Z","size":89806,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-22T12:31:56.915Z","etag":null,"topics":["combinatorial-optimization","research-paper"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc-by-sa-4.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/maxkapur.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","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":"2022-04-27T06:48:29.000Z","updated_at":"2022-07-25T04:50:44.000Z","dependencies_parsed_at":"2025-01-22T12:38:51.986Z","dependency_job_id":null,"html_url":"https://github.com/maxkapur/CollegeApplication","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maxkapur%2FCollegeApplication","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maxkapur%2FCollegeApplication/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maxkapur%2FCollegeApplication/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maxkapur%2FCollegeApplication/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/maxkapur","download_url":"https://codeload.github.com/maxkapur/CollegeApplication/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243806041,"owners_count":20350775,"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":["combinatorial-optimization","research-paper"],"created_at":"2024-11-21T21:07:49.981Z","updated_at":"2026-01-02T22:44:06.625Z","avatar_url":"https://github.com/maxkapur.png","language":"TeX","readme":"# CollegeApplication\n\nWorking repo for my MS thesis, “The College Application Problem,” at Seoul National University. You can download the PDF (`thesis/paper-en.pdf` or `thesis/paper-ko.pdf`) in your preferred language, or clone the repo and run `make` to build from the LaTeX source.\n\nIf you found this research useful, please consider citing either [our arXiv paper](https://arxiv.org/abs/2205.01869) or this thesis:\n\n- Kapur, Max. 2022. “The College Application Problem.” MS thesis, Seoul National University. \u003chttps://github.com/maxkapur/CollegeApplication\u003e.\n\nI’d prefer that you use this GitHub repo as the URL (so that I can fix typos 🤣), but if your style guide requires an “official” link, you can use \u003chttp://www.dcollection.net/handler/snu/000000172202\u003e, which comes from the SNU thesis archive. The Korean text there matches the `v0.1.0` release tagged here.\n\n## Table of contents\n\n| Directory | Contents | Formats | English | Korean | Coauthors |\n|-----------|----------|---------|---------|--------|-----------|\n| `paper_alma/`   |  A concise paper on the cardinality-constrained college admissions problem (Alma’s problem), focusing on the greedy algorithm and student welfare analysis. | PDF, LaTeX | ✓ | | Yim Seho, Sung-Pil Hong | \n| `paper_ellis/`  |  A concise paper on the knapsack-constrained college admissions problem (Ellis’s problem), focusing on its computational complexity and exact and approximate algorithms. | PDF, LaTeX | ✓ | ||\n| `poster/`       |  A one-sheet summary of the research prepared for JuliaCon 2022, with an emphasis on the `OptimalApplication.jl` package. | PDF, ODT | ✓ | ||\n| `slides_03min/` |  Slides and script for the JuliaCon 2022 presentation. [Click here](https://maxkapur.com/CollegeApplication/) to view them in your browser. | HTML | ✓ | ||\n| `slides_08min/` |  Slides and script for a presentation at the department’s research fair. | PDF, LaTeX | ✓ | ✓ ||\n| `slides_15min/` |  Slides and script for a presentation at the spring 2022 conference of the Korean industrial engineering society (대한산업공학회). | PDF, LaTeX | ✓ | ✓ ||\n| `slides_25min/` |  Slides and script for my defense presentation. | PDF, LaTeX | ✓ | ✓ ||\n| `thesis/`       |  My MS thesis. The contents are essentially the same as the arXiv paper, but updates appear here first. | PDF, LaTeX | ✓ | ✓ ||\n\nFor the associated Julia package, which implements the algorithms provided in paper, see https://github.com/maxkapur/OptimalApplication.\n\nComments and suggestions are welcome via email ([maxkapur@gmail.com](mailto:maxkapur@gmail.com)) or GitHub pull request.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxkapur%2Fcollegeapplication","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaxkapur%2Fcollegeapplication","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxkapur%2Fcollegeapplication/lists"}