On-line stream merging with max span and min coverage

被引：1

作者：

Chan, WT ^{[1
]}

Lam, TW

Ting, HF

Wong, PWH

机构：

[1] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China

[2] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China

来源：

THEORY OF COMPUTING SYSTEMS | 2005年 / 38卷 / 04期

关键词：

Computational Mathematic; Greedy Algorithm; Competitive Ratio; Performance Guarantee; Simple Greedy Algorithm;

D O I：

10.1007/s00224-004-1182-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. It is shown that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that attains the ideal span and coverage, thus giving a better performance guarantee than existing algorithms. The new notions also allow us to obtain a tighter analysis of existing algorithms.

引用

页码：461 / 479

页数：19

共 50 条

[21] A Bayesian approach for on-line max auditing
Canfora, Gerardo
Cavallo, Bice
ARES 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON AVAILABILITY, SECURITY AND RELIABILITY, 2008, : 1020 - 1027
[22] Min-max coverage problems on tree-like metrics
Aaron, Eric
Hebert-Johnson, Ursula
Krizanc, Danny
Lokshtanov, Daniel
XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 148 - 156
[23] On-line Television Stream Classification by Genre
Briedis, Karlis Martins
Freivalds, Karlis
BALTIC JOURNAL OF MODERN COMPUTING, 2018, 6 (03): : 235 - 246
[24] A POINTER-FREE DATA STRUCTURE FOR MERGING HEAPS AND MIN-MAX HEAPS
GAMBOSI, G
NARDELLI, E
TALAMO, M
THEORETICAL COMPUTER SCIENCE, 1991, 84 (01) : 107 - 126
[25] A POINTER-FREE DATA STRUCTURE FOR MERGING HEAPS AND MIN-MAX HEAPS
GAMBOSI, G
NARDELLI, E
TALAMO, M
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 405 - 438
[26] The hybrid course: Merging on-line instruction and the traditional classroom
Gordon E. McCray
Information Technology and Management, 2000, 1 (4) : 307 - 327
[27] On-line models and algorithms for max independent set
Escoffier, Bruno
Paschos, Vangelis Th.
RAIRO-OPERATIONS RESEARCH, 2006, 40 (02) : 129 - 142
[28] ON-LINE MEASUREMENT OF PAGING BEHAVIOR BY MULTIVALUED MIN ALGORITHM
BELADY, LA
PALERMO, FP
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1974, 18 (01) : 2 - 19
[29] Optimal On-Line Computation of Stack Distances for MIN and OPT
Bilardi, Gianfranco
Ekanadham, Kattamuri
Pattnaik, Pratap
ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS 2017, 2017, : 237 - 246
[30] Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage
Zou, Wenjie
Guo, Longkun
Huang, Peihuang
Lin, Geng
Mei, Hengquan
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (02):

← 1 2 3 4 5 →