Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line

We study the online minimum cost bipartite perfect matching with delays problem. In this problem, servers and requests arrive over time, and an online algorithm can delay the matching between servers and requests by paying the delay cost. The objective is to minimize the total distance and delay cos...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 69; číslo 3; s. 28
Hlavný autor:	Kuo, Tung-Wei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2025 Springer Nature B.V
Predmet:	Algorithms Competition Computer Science Delay Matching Metric space Minimum cost Theory of Computation Minimum cost bipartite matching with delays Online algorithm Deterministic algorithm One-dimensional metric space
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!