IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL

被引：12

作者：

Epstein, Leah ^{[1
]}

Levin, Asaf ^{[2
]}

Mestre, Julian ^{[3
]}

Segev, Danny ^{[4
]}

机构：

[1] Univ Haifa, Dept Math, IL-31905 Haifa, Israel

[2] Technion, Fac Ind Engn & Management, IL-32000 Haifa, Israel

[3] Max Planck Inst Informat, D-66123 Saarbrucken, Germany

[4] Univ Haifa, Dept Stat, IL-31905 Haifa, Israel

来源：

27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010) | 2010年 / 5卷

关键词：

ALGORITHMS;

D O I：

10.4230/LIPIcs.STACS.2010.2476

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 669-680) by devising a deterministic approach whose performance guarantee is 4.91 + epsilon. In addition, we study preemptive online algorithms, a sub-class of one-pass algorithms where we are only allowed to maintain a feasible matching in memory at any point in time. All known results prior to Zelke's belong to this sub-class. We provide a lower bound of 4.967 on the competitive ratio of any such deterministic algorithm, and hence show that future improvements will have to store in memory a set of edges which is not necessarily a feasible matching. We conclude by presenting an empirical study, conducted in order to compare the practical performance of our approach to that of previously suggested algorithms.

引用

页码：347 / 358

页数：12

共 50 条

[41] FPGA Implementation of MobileNetV2 CNN Model Using Semi-Streaming Architecture for Low Power Inference Applications
Shaydyuk, Nazariy K.
John, Eugene B.
2020 IEEE INTL SYMP ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, INTL CONF ON BIG DATA & CLOUD COMPUTING, INTL SYMP SOCIAL COMPUTING & NETWORKING, INTL CONF ON SUSTAINABLE COMPUTING & COMMUNICATIONS (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2020), 2020, : 160 - 167
[42] An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Low, Chor Ping
INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 154 - 161
[43] Parikh Matching in the Streaming Model
Lee, Lap-Kei
Lewenstein, Moshe
Zhang, Qin
STRING PROCESSING AND INFORMATION RETRIEVAL: 19TH INTERNATIONAL SYMPOSIUM, SPIRE 2012, 2012, 7608 : 336 - 341
[44] Improved approximation guarantees for packing and covering integer programs
Srinivasan, A
SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 648 - 670
[45] Improved approximation guarantees for packing and covering integer programs
Srinivasan, Aravind
SIAM Journal on Computing, 29 (02): : 648 - 670
[46] A simple approximation algorithm for the weighted matching problem
Drake, DE
Hougardy, S
INFORMATION PROCESSING LETTERS, 2003, 85 (04) : 211 - 213
[47] Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees
Schiefer, Nicholas
Chen, Justin Y.
Indyk, Piotr
Narayanan, Shyam
Silwal, Sandeep
Wagner, Tal
SIAM CONFERENCE ON APPLIED AND COMPUTATIONAL DISCRETE ALGORITHMS, ACDA23, 2023, : 87 - 97
[48] A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs"
Lee, Kangbok
Leung, Joseph Y. -T.
Pinedo, Michael L.
INFORMATION PROCESSING LETTERS, 2009, 109 (12) : 608 - 610
[49] Improved Weighted Matching for Speaker Recognition
Mut, Ozan
Goektuerk, Mehmet
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 5, 2005, 5 : 229 - 231
[50] Improved Approximation Algorithms for Stochastic Matching
Adamczyk, Marek
Grandoni, Fabrizio
Mukherjee, Joydeep
ALGORITHMS - ESA 2015, 2015, 9294 : 1 - 12

← 1 2 3 4 5 →