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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of computing systems Jg. 64; H. 4; S. 572 - 592
Hauptverfasser:	Azar, Yossi, Jacob Fanani, Amit
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2020 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	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 minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched. In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with one of two classes, and requests can only be matched with requests of the other class. Previous algorithms for the problems mentioned above, include randomized O ( log ( n ) ) -competitive algorithms for known and finite metric spaces, n being the size of the metric space, and a deterministic O m -competitive algorithm, m being the number of requests. We introduce O 1 𝜖 m log 2 3 2 + 𝜖 -competitive deterministic algorithms for both problems and for any fixed 𝜖 > 0. In particular, for a small enough 𝜖 the competitive ratio becomes O m 0.59 . These are the first deterministic algorithms for the mentioned online matching problems, achieving a sub-linear competitive ratio. We also show that the analysis of our algorithms is tight. Our algorithms do not need to know the metric space in advance.
AbstractList	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 minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched. In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with one of two classes, and requests can only be matched with requests of the other class. Previous algorithms for the problems mentioned above, include randomized O ( log ( n ) ) -competitive algorithms for known and finite metric spaces, n being the size of the metric space, and a deterministic O m -competitive algorithm, m being the number of requests. We introduce O 1 𝜖 m log 2 3 2 + 𝜖 -competitive deterministic algorithms for both problems and for any fixed 𝜖 > 0. In particular, for a small enough 𝜖 the competitive ratio becomes O m 0.59 . These are the first deterministic algorithms for the mentioned online matching problems, achieving a sub-linear competitive ratio. We also show that the analysis of our algorithms is tight. Our algorithms do not need to know the metric space in advance. 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 minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched. In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with one of two classes, and requests can only be matched with requests of the other class. Previous algorithms for the problems mentioned above, include randomized O(log(n))-competitive algorithms for known and finite metric spaces, n being the size of the metric space, and a deterministic Om-competitive algorithm, m being the number of requests. We introduce O1ðoe-mlog232+ðoe--competitive deterministic algorithms for both problems and for any fixed ðoe- > 0. In particular, for a small enough ðoe- the competitive ratio becomes Om0.59. These are the first deterministic algorithms for the mentioned online matching problems, achieving a sub-linear competitive ratio. We also show that the analysis of our algorithms is tight. Our algorithms do not need to know the metric space in advance.
Author	Azar, Yossi Jacob Fanani, Amit
Author_xml	– sequence: 1 givenname: Yossi orcidid: 0000-0002-5097-8993 surname: Azar fullname: Azar, Yossi email: azar@tau.ac.il organization: School of Computer Science, Tel Aviv University – sequence: 2 givenname: Amit surname: Jacob Fanani fullname: Jacob Fanani, Amit organization: School of Computer Science, Tel Aviv University
BookMark	eNp9kE1LAzEQhoNUsK3-AU8LHiU62Xzs5iitX9DiRc8hZpM2pc3WJEX67912BcFDTzOH95l5eUZoENpgEbomcEcAqvsEUJYMA5EYpBQUV2doSBilGJiEwXEvMaMcLtAopRUA0BpgiG6nNtu48cGn7E0x9wFP2pSLuc5m6cOi-PZ5WUztWu_TJTp3ep3s1e8co4-nx_fJC569Pb9OHmbYUCIz5s46WZuKE00d19JIQ5ipwEmjpWCsaTQzwhjxKagDY2UjeCOB17XgXSdCx-imv7uN7dfOpqxW7S6G7qUqqeSMyZJVXaruUya2KUXrlPFZZ9-GHLVfKwLqoEb1alSnRh3VqANa_kO30W903J-GaA-lLhwWNv61OkH9AKM7dtI
CitedBy_id	crossref_primary_10_1137_20M1346286 crossref_primary_10_1007_s00224_024_10207_6 crossref_primary_10_1016_j_tcs_2024_114988
Cites_doi	10.1006/jagm.1993.1026 10.4153/CJM-1965-045-4 10.7249/R366 10.1007/BFb0029573 10.1007/978-3-319-89441-6_11 10.1007/978-3-319-18263-6_2 10.1007/s00453-012-9676-9 10.1007/978-3-030-04693-4_4 10.1007/978-3-319-57586-5_18 10.1137/1.9781611974782.67 10.1109/FOCS.2017.53 10.1137/0210050 10.1007/978-3-540-24592-6_14 10.1145/1109557.1109662 10.1145/3055399.3055475 10.1007/3-540-54233-7_178 10.1145/2897518.2897557 10.1016/j.tcs.2004.10.028 10.1007/978-3-642-31594-7_36
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020.
Copyright_xml	– notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U
DOI	10.1007/s00224-019-09963-7
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central Database Suite (ProQuest) url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1433-0490
EndPage	592
ExternalDocumentID	10_1007_s00224_019_09963_7
GrantInformation_xml	– fundername: Israel Science Foundation grantid: 1506/16 – fundername: ICRC Blavatnik fund
GroupedDBID	--Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ3 GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c319t-5fef98c751a3f5a9c9c14c70f9ca9644dda4c6cc6b63f0ce9d65d905886580013
IEDL.DBID	RSV
ISICitedReferencesCount	12
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000529327700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1432-4350
IngestDate	Tue Nov 04 23:15:19 EST 2025 Tue Nov 18 21:52:07 EST 2025 Sat Nov 29 03:28:55 EST 2025 Fri Feb 21 02:34:31 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Matching Delayed service Bipartite matching Online algorithm Competitive analysis
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-5fef98c751a3f5a9c9c14c70f9ca9644dda4c6cc6b63f0ce9d65d905886580013
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-5097-8993
PQID	2395449247
PQPubID	48907
PageCount	21
ParticipantIDs	proquest_journals_2395449247 crossref_citationtrail_10_1007_s00224_019_09963_7 crossref_primary_10_1007_s00224_019_09963_7 springer_journals_10_1007_s00224_019_09963_7
PublicationCentury	2000
PublicationDate	20200500 2020-05-00 20200501
PublicationDateYYYYMMDD	2020-05-01
PublicationDate_xml	– month: 5 year: 2020 text: 20200500
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Theory of computing systems
PublicationTitleAbbrev	Theory Comput Syst
PublicationYear	2020
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	BansalNBuchbinderNGuptaANaorJA randomized O(log2k)-competitive algorithm for metric bipartite matchingAlgorithmica2014682390403315205410.1007/s00453-012-9676-9 Bienkowski, M., Kraska, A., Schmidt, P.: A match in time saves nine: deterministic online matching with delays. In: Approximation and Online Algorithms - 15Th International Workshop, pp. 132–146 (2017) Dantzig, G.B.: Linear programming and extensions. Princeton University Press (1963) FuchsBHochstättlerWKernWOnline matching on a lineTheor. Comput. Sci.20053321-3251264212250510.1016/j.tcs.2004.10.028 Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Automata, Languages, and Programming - 39Th International Colloquium, pp. 424–435 (2012) Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste!. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 333–344 (2016) Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A O(N)-competitive deterministic algorithm for online matching on a line. In: Approximation and Online Algorithms - 12Th International Workshop, pp. 11–22 (2014) Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for Two sources. In: Algorithms and Complexity - 10Th International Conference, pp. 209–221 (2017) Meyerson, A., Nanavati, A., Poplawski, L.J.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 954–959 (2006) Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Approximation and Online Algorithms, First International Workshop, pp. 179–191 (2003) Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 18:1–18:16 (2016) Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. In: Automata, Languages and Programming, 18Th International Colloquium, pp. 728–738 (1991) ReingoldEMTarjanREOn a greedy heuristic for complete matchingSIAM J. Comput.198110467668163542510.1137/0210050 Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 551–563 (2017) Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: 58Th IEEE Annual Symposium on Foundations of Computer Science, pp. 505–515 (2017) KalyanasundaramBPruhsKOnline weighted matchingJ. Algorithms1993143478488121312110.1006/jagm.1993.1026 Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R.M., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 1:1–1:20 (2017) Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1051–1061 (2017) EdmondsJPaths, trees, and flowersCan. J. Math.19651744946717790710.4153/CJM-1965-045-4 Kalyanasundaram, B., Pruhs, K.: On-Line Network Optimization Problems. In: Online Algorithms, the State of the Art (The Book Grow out of a Dagstuhl Seminar), pp. 268–280 (1996) Bienkowski, M., Kraska, A., Liu, H.H., Schmidt, P.: A primal-dual online deterministic algorithm for matching with delays. arXiv:abs/1804.08097 (2018) 9963_CR7 J Edmonds (9963_CR9) 1965; 17 9963_CR11 9963_CR8 9963_CR10 9963_CR13 9963_CR6 9963_CR3 9963_CR15 9963_CR4 9963_CR1 9963_CR17 9963_CR2 9963_CR16 9963_CR19 EM Reingold (9963_CR21) 1981; 10 9963_CR18 N Bansal (9963_CR5) 2014; 68 B Kalyanasundaram (9963_CR14) 1993; 14 B Fuchs (9963_CR12) 2005; 332 9963_CR20
References_xml	– reference: Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 551–563 (2017) – reference: KalyanasundaramBPruhsKOnline weighted matchingJ. Algorithms1993143478488121312110.1006/jagm.1993.1026 – reference: Dantzig, G.B.: Linear programming and extensions. Princeton University Press (1963) – reference: Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. In: Automata, Languages and Programming, 18Th International Colloquium, pp. 728–738 (1991) – reference: Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: 58Th IEEE Annual Symposium on Foundations of Computer Science, pp. 505–515 (2017) – reference: Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 18:1–18:16 (2016) – reference: FuchsBHochstättlerWKernWOnline matching on a lineTheor. Comput. Sci.20053321-3251264212250510.1016/j.tcs.2004.10.028 – reference: Meyerson, A., Nanavati, A., Poplawski, L.J.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 954–959 (2006) – reference: Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste!. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 333–344 (2016) – reference: Emek, Y., Shapiro, Y., Wang, Y.: Minimum cost perfect matching with delays for Two sources. In: Algorithms and Complexity - 10Th International Conference, pp. 209–221 (2017) – reference: Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Automata, Languages, and Programming - 39Th International Colloquium, pp. 424–435 (2012) – reference: Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R.M., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 1:1–1:20 (2017) – reference: Kalyanasundaram, B., Pruhs, K.: On-Line Network Optimization Problems. In: Online Algorithms, the State of the Art (The Book Grow out of a Dagstuhl Seminar), pp. 268–280 (1996) – reference: Bienkowski, M., Kraska, A., Schmidt, P.: A match in time saves nine: deterministic online matching with delays. In: Approximation and Online Algorithms - 15Th International Workshop, pp. 132–146 (2017) – reference: EdmondsJPaths, trees, and flowersCan. J. Math.19651744946717790710.4153/CJM-1965-045-4 – reference: BansalNBuchbinderNGuptaANaorJA randomized O(log2k)-competitive algorithm for metric bipartite matchingAlgorithmica2014682390403315205410.1007/s00453-012-9676-9 – reference: Bienkowski, M., Kraska, A., Liu, H.H., Schmidt, P.: A primal-dual online deterministic algorithm for matching with delays. arXiv:abs/1804.08097 (2018) – reference: Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A O(N)-competitive deterministic algorithm for online matching on a line. In: Approximation and Online Algorithms - 12Th International Workshop, pp. 11–22 (2014) – reference: ReingoldEMTarjanREOn a greedy heuristic for complete matchingSIAM J. Comput.198110467668163542510.1137/0210050 – reference: Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Approximation and Online Algorithms, First International Workshop, pp. 179–191 (2003) – reference: Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1051–1061 (2017) – volume: 14 start-page: 478 issue: 3 year: 1993 ident: 9963_CR14 publication-title: J. Algorithms doi: 10.1006/jagm.1993.1026 – volume: 17 start-page: 449 year: 1965 ident: 9963_CR9 publication-title: Can. J. Math. doi: 10.4153/CJM-1965-045-4 – ident: 9963_CR8 doi: 10.7249/R366 – ident: 9963_CR15 doi: 10.1007/BFb0029573 – ident: 9963_CR7 doi: 10.1007/978-3-319-89441-6_11 – ident: 9963_CR1 doi: 10.1007/978-3-319-18263-6_2 – volume: 68 start-page: 390 issue: 2 year: 2014 ident: 9963_CR5 publication-title: Algorithmica doi: 10.1007/s00453-012-9676-9 – ident: 9963_CR6 doi: 10.1007/978-3-030-04693-4_4 – ident: 9963_CR11 doi: 10.1007/978-3-319-57586-5_18 – ident: 9963_CR3 doi: 10.1137/1.9781611974782.67 – ident: 9963_CR20 – ident: 9963_CR19 doi: 10.1109/FOCS.2017.53 – volume: 10 start-page: 676 issue: 4 year: 1981 ident: 9963_CR21 publication-title: SIAM J. Comput. doi: 10.1137/0210050 – ident: 9963_CR2 – ident: 9963_CR17 doi: 10.1007/978-3-540-24592-6_14 – ident: 9963_CR18 doi: 10.1145/1109557.1109662 – ident: 9963_CR4 doi: 10.1145/3055399.3055475 – ident: 9963_CR16 doi: 10.1007/3-540-54233-7_178 – ident: 9963_CR10 doi: 10.1145/2897518.2897557 – volume: 332 start-page: 251 issue: 1-3 year: 2005 ident: 9963_CR12 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2004.10.028 – ident: 9963_CR13 doi: 10.1007/978-3-642-31594-7_36
SSID	ssj0003800
Score	2.3209078
Snippet	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...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	572
SubjectTerms	Algorithms Competition Computer Science Matching Metric space Special Issue on Approximation and Online Algorithms 2018 Theory of Computation
SummonAdditionalLinks	– databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR1NS8Mw9KHTgx6cTsXplB68abBfaZKTyHQIsuFBYbeSvqYwGNtcq-C_N8nSDgW9eO5rCO_7vbwPgEuqdHAsWEAyGWYkzjUthBSCcEozjpGfRUVml02w0YiPx-LZJdxKV1ZZ60SrqPM5mhz5TRgJGsc6WmC3izditkaZ11W3QmMTtoIwDAyfPzHSaOKI2xYU7RKYziDqu6YZ2zpnjZcOpE3BkGZCwr4bprW3-eOB1NqdQfu_N96HPedxencrFjmADTXrQLve5uA54e7A7rCZ4FoeglZEqzoZO8jZG05mpD8vK08D2epLzyRwvXs1lZ_lEbwOHl76j8QtViCoJa4itFCF4MhoIKOCSoECgxiZXwiUQjtIeS5jTBCTLIkKH5XIE5oLn3Ku_RXjNB5DazafqRPwNEAujc1DnsQ8UDISMuchhswM0pe8C0GN1RTd1HGz_GKaNvOSLSVSTYnUUiJlXbhq_lmsZm78Cd2r0Z86-SvTNe67cF0TcP3599NO_z7tDHZCE3DbiscetKrluzqHbfyoJuXywnLfF30w3Bc priority: 102 providerName: ProQuest
Title	Deterministic Min-Cost Matching with Delays
URI	https://link.springer.com/article/10.1007/s00224-019-09963-7 https://www.proquest.com/docview/2395449247
Volume	64
WOSCitedRecordID	wos000529327700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR3LSsNAcNDWgx6sT6zWkoM3Xchrs7tHrRZBWkrr-xI2mwQKJZWmCv69s9skRVFBLwNhJ0uYx85Mdh4AJzTB4Fgwh0TSjYgfIy-EFIJwSiOuPDvy0sgMm2D9Pn98FIOiKCwvs93LK0lzUlfFbsbcYOirU3xQbAhbhTqaO67VcTi6r85fj5vCE3QEdD0QtYtSme_3-GyOlj7ml2tRY226jf995xZsFt6ldb4Qh21YSbIdaJSTG6xCkXdgo1d1a813AQ-dRU6Madps9cYZ6UzzuYVIJtPS0j9rrctkIt_zPbjrXt12rkkxRIEo1K45oWmSCq4YdaSXUimUUI6vmJ0KJQU6Q3EsfRUoFUSBl9oqEXFAY2FTztE30Q7iPtSyaZYcgIUIsdT2TfHA504iPSFj7iqX6ab5kjfBKWkZqqLDuB50MQmr3siGNiHSJjS0CVkTTqt3Xhb9NX7FbpUsCgtdy0PXE9T3MY7E5bOSJcvln3c7_Bv6Eay7Otg22Y4tqM1nr8kxrKm3-TiftWGVPTy1oX5x1R8M8emGEYQ9u6OhO9CQjRAO6HPbyOsHzprZnQ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60CurBR1WsVs1BT7qY1ya7BxGpikVbPFToLW42GyiUtjZV6Z_yNzq7TVoU9NaD52wGkm92Hrsz8wGcUIXJMQ8dEgs3Jn6CWHDBOWGUxkx6duylsSGbCJtN1m7zpwX4LHphdFllYRONoU76Up-RX7gep76P2UJ4NXglmjVK364WFBoTtXhQ4w9M2bLL-g3ie-q6d7et2j3JWQWIRHUbEZqqlDMZUkd4KRVccun4MrRTLgXH6CBJhC8DKYM48FJbKp4ENOE2ZQydtY6YUO4iLPk-bgddKmjXppbfY6blBUMQ3YlE7bxJx7TqGWeJibsuUEKlJ-F3RziLbn9cyBo_d7fx3_7QJqznEbV1PdkCW7CgemXYKNgqrNx4lWGtMZ1Qm20DGtpJHZAZVG01Oj1S62cjCxeZ6lJLH1BbN6orxtkOPM_lA3ah1Ov31B5YuCAR2qdLFvjMUcLjImGudENNFCBYBZwCxUjmU9U1uUc3ms6DNshHiHxkkI_CCpxN3xlMZor8ubpawB3l9iWLZlhX4LxQmNnj36Xt_y3tGFbuW43H6LHefDiAVVcfLpjqziqURsM3dQjL8n3UyYZHRvMteJm3In0BbI45yw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSwMxEB58IXrwLdbnHvSkofvKJjmIiLVYaosHBW9rNpuFQmlrtyr-NX-dk3S3RUFvHjxvNrA738w3k8wD4JhqDI4F80gi_YSEKcpCSCEIpzThKnCTIEvssAnWbvPHR3E3Ax9lLYxJqyxtojXUaV-ZM_KqHwgahhgtsGpWpEXc1eoXg2diJkiZm9ZynMYYIk39_obhW37eqKGsT3y_fn1_dUOKCQNEIfRGhGY6E1wx6skgo1IoobxQMTcTSgr0FNJUhipSKkqiIHOVFmlEU-FSzpG4jfeE-87CPLIwNTrWZGTCAgG35S_ojpiqJOoWBTu2bM8SJwbxJlkJFYCwr6Q49XS_Xc5azquv_ue_tQYrhaftXI5VYx1mdG8DVsspFk5h1DZguTXpXJtvAhrgcX6QbWDttDo9ctXPRw4uslmnjjm4dmq6K9_zLXj4kw_Yhrlev6d3wMEFqTRcr3gUck_LQMiU-8pnZoCA5BXwSonGqui2boZ-dONJn2iLghhREFsUxKwCp5N3BuNeI7-u3i9FHxd2J4-ncq_AWQme6eOfd9v9fbcjWET8xLeNdnMPlnxz5mCTPvdhbjR80QewoF5HnXx4aJXAgae_xtEnVRNCcQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Deterministic+Min-Cost+Matching+with+Delays&rft.jtitle=Theory+of+computing+systems&rft.au=Azar%2C+Yossi&rft.au=Jacob+Fanani%2C+Amit&rft.date=2020-05-01&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=64&rft.issue=4&rft.spage=572&rft.epage=592&rft_id=info:doi/10.1007%2Fs00224-019-09963-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00224_019_09963_7
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon