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 条

[11] Comparison of Pure Greedy Algorithm with Pure Greedy Algorithm in a Pair of Dictionaries
Orlova, A. S.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2023, 78 (02) : 57 - 66
[12] Greedy Spiral Dynamic Algorithm with Application to Controller Design
Hashim, M. R.
Tokhi, M. O.
2016 IEEE CONFERENCE ON SYSTEMS, PROCESS AND CONTROL (ICSPC), 2016, : 29 - 32
[13] AN ANALYSIS OF THE GREEDY ALGORITHM FOR PARTIALLY ORDERED SETS
CROITORU, C
DISCRETE APPLIED MATHEMATICS, 1982, 4 (02) : 113 - 117
[14] Comparison of Pure Greedy Algorithm with Pure Greedy Algorithm in a Pair of Dictionaries
A. S. Orlova
Moscow University Mathematics Bulletin, 2023, 78 : 57 - 66
[15] Covering Analysis of the Greedy Algorithm for Partial Cover
Elomaa, Tapio
Kujala, Jussi
ALGORITHMS AND APPLICATIONS: ESSAYS DEDICATED TO ESKO UKKONEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2010, 6060 : 102 - 113
[16] An Analysis of Printed Illustrations of Three Algorithm Design Techniques
Esteban-Sanchez, Natalia
Perez-Carrasco, Antonio
Saenz-Rubio, Belen
Angel Velazquez-Iturbide, J.
IEEE REVISTA IBEROAMERICANA DE TECNOLOGIAS DEL APRENDIZAJE-IEEE RITA, 2014, 9 (02): : 57 - 63
[17] Greedy algorithm for tolerating defective crosspoints in NanoPLA design
Naeimi, H
DeHon, A
2004 IEEE INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, PROCEEDINGS, 2004, : 49 - 56
[18] Improved analysis of the greedy algorithm for stochastic matching
Adamczyk, Marek
INFORMATION PROCESSING LETTERS, 2011, 111 (15) : 731 - 737
[19] An average case analysis of a greedy algorithm for the on-line Steiner tree problem
Tsai, YT
Tang, CY
Chen, YY
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1996, 31 (11) : 121 - 131
[20] A tight analysis of the greedy algorithm for set cover
Slavik, P
JOURNAL OF ALGORITHMS, 1997, 25 (02) : 237 - 254

← 1 2 3 4 5 →