DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/1566| Title: | Online metric matching in euclidean norm |
| Authors: | Marwah, Ishaan Seth, Ritesh Das, Syamantak (Advisor) |
| Keywords: | Metric Space Online Algorithms Randomized Algorithms Online Metric Matching Min-cost matching. |
| Issue Date: | 29-Nov-2023 |
| Publisher: | IIIT-Delhi |
| Abstract: | This report addresses the problem of online metric matching. In this scenario, a group of servers is situated within a metric space, and requests continuously arrive over time in an unpredictable manner. The objective is to promptly match each incoming request with an available server. The cost of matching a request to a server is determined by the distance between them in the metric space. The ultimate goal is to minimize the expected total cost incurred while matching all the requests to the servers. |
| URI: | http://repository.iiitd.edu.in/xmlui/handle/123456789/1566 |
| Appears in Collections: | Year-2023 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Online_Metric_Matching_btp - Ishaan Marwah.pdf Restricted Access | 588.36 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.