Deterministic Min-Cost Matching with Delays

We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is given, and requests for points in space are submitted in different times in this space by an adversary. The goal is to match requests, while minim...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 64; no. 4; pp. 572 - 592
Main Authors:	Azar, Yossi, Jacob Fanani, Amit
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2020 Springer Nature B.V
Subjects:	Algorithms Competition Computer Science Matching Metric space Special Issue on Approximation and Online Algorithms 2018 Theory of Computation Matching Delayed service Bipartite matching Online algorithm Competitive analysis
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!