Online metric matching in euclidean norm

Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/1566

Full metadata record

DC Field	Value	Language
dc.contributor.author	Marwah, Ishaan	-
dc.contributor.author	Seth, Ritesh	-
dc.contributor.author	Das, Syamantak (Advisor)	-
dc.date.accessioned	2024-05-22T10:17:26Z	-
dc.date.available	2024-05-22T10:17:26Z	-
dc.date.issued	2023-11-29	-
dc.identifier.uri	http://repository.iiitd.edu.in/xmlui/handle/123456789/1566	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	IIIT-Delhi	en_US
dc.subject	Metric Space	en_US
dc.subject	Online Algorithms	en_US
dc.subject	Randomized Algorithms	en_US
dc.subject	Online Metric Matching	en_US
dc.subject	Min-cost matching.	en_US
dc.title	Online metric matching in euclidean norm	en_US
dc.type	Other	en_US
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

DSpace JSPUI