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 条

[1] On-line stream merging, max span, and min coverage
Chan, WT
Lam, TW
Ting, HF
Wong, PWH
ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2003, 2653 : 70 - 82
[2] On-line Stream Merging with Max Span and Min Coverage
Wun-Tat Chan
Tak-Wah Lam
Hing-Fung Ting
Prudence W.H. Wong
Theory of Computing Systems, 2005, 38 : 461 - 479
[3] On-line stream merging in a general setting
Chan, WT
Lam, TW
Ting, HF
Wong, PWH
THEORETICAL COMPUTER SCIENCE, 2003, 296 (01) : 27 - 46
[4] Competitive analysis of on-line stream merging algorithms
Chan, WT
Lam, TW
Ting, HF
Wong, PWH
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 188 - 200
[5] Competitive on-line stream merging algorithms for media-on-demand
Bar-Noy, A
Ladner, RE
PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 364 - 373
[6] Improved on-line stream merging: From a restricted to a general setting
Chan, WT
Lam, TW
Ting, HF
Wong, WH
COMPUTING AND COMBINATORICS, 2001, 2108 : 432 - 442
[7] Competitive on-line stream merging algorithms for media-on-demand
Bar-Noy, A
Ladner, RE
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 48 (01): : 59 - 90
[8] On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary
Huang, Peihuang
Zhu, Wenxing
Guo, Longkun
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2019, 2019, 11436 : 313 - 324
[9] Emergent on-line learning in min-max modular neural networks
Lu, BL
Ichikawa, M
IJCNN'01: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2001, : 2650 - 2655
[10] Max–min dispersion on a line
Tetsuya Araki
Shin-ichi Nakano
Journal of Combinatorial Optimization, 2022, 44 : 1824 - 1830

← 1 2 3 4 5 →