Designing Optimal Compact Oblivious Routing for Datacenter Networks in Polynomial Time (INFOCOM 2023)
-
Updated
May 25, 2023 - Python
Designing Optimal Compact Oblivious Routing for Datacenter Networks in Polynomial Time (INFOCOM 2023)
This "Travel Route Planner" project optimizes travel plan within budget and distance constraints. Using Knapsack & Greedy Method for budget allocation and dynamic programming for TSP, it offers efficient routes. With geocoding & mapping, it tailors plans for satisfying travel experiences.
UCLA PIC16B course project --- an LA travel planner webapp.
Optimal Oblivious Routing with Concave Objective for Structured Networks (TON 2023)
Add a description, image, and links to the optimal-routes topic page so that developers can more easily learn about it.
To associate your repository with the optimal-routes topic, visit your repo's landing page and select "manage topics."