Techniques for algorithm design and analysis: case study of a greedy algorithm

被引：0

作者：

Klostermeyer, William F. ^{[1
]}

Muslea, Maria ^{[1
]}

机构：

[1] West Virginia Univ, Morgantown, United States

来源：

Informatica (Ljubljana) | 1996年 / 20卷 / 02期

关键词：

Computational complexity - Graph theory - Heuristic methods - Set theory - Systems analysis;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Six different implementations of a greedy dominating set algorithm are presented and analyzed. The implementations and analysis illustrate many of the important techniques in the design and analysis of algorithms, as well as some interesting graph theory.

引用

页码：185 / 190

共 50 条

[21] Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Calvin, JM
Leung, JYT
OPERATIONS RESEARCH LETTERS, 2003, 31 (03) : 202 - 210
[22] Conical Greedy Algorithm
Valov, M. A.
MATHEMATICAL NOTES, 2022, 112 (1-2) : 171 - 176
[23] A framework for the greedy algorithm
Vince, A
DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 247 - 260
[24] A NOTE ON THE GREEDY ALGORITHM
ALLINEY, S
BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 1992, 6B (04): : 873 - 886
[25] Greedy algorithm with gaps
Oikhberg, T.
JOURNAL OF APPROXIMATION THEORY, 2018, 225 : 176 - 190
[26] Projection Greedy Algorithm
Borodin, P. A.
Konyagin, S. V.
MATHEMATICAL NOTES, 2021, 110 (1-2) : 16 - 25
[27] On the recursive greedy algorithm
Livshits, E. D.
IZVESTIYA MATHEMATICS, 2006, 70 (01) : 87 - 108
[28] Conical Greedy Algorithm
M. A. Valov
Mathematical Notes, 2022, 112 : 171 - 176
[29] The constrained greedy algorithm
El-Aker, F
FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 190 - 193
[30] ON THE GREEDY ALGORITHM FOR SATISFIABILITY
KOUTSOUPIAS, E
PAPADIMITRIOU, CH
INFORMATION PROCESSING LETTERS, 1992, 43 (01) : 53 - 55

← 1 2 3 4 5 →