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...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 64; číslo 4; s. 572 - 592
Hlavní autori:	Azar, Yossi, Jacob Fanani, Amit
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2020 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!