Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Information Science and Applications |
| Seiten | 1033-1041 |
| Seitenumfang | 9 |
| ISBN (elektronisch) | 978-3-662-46578-3 |
| Publikationsstatus | Veröffentlicht - 18 Feb. 2015 |
Publikationsreihe
| Name | Lecture Notes in Electrical Engineering |
|---|---|
| Band | 339 |
| ISSN (Print) | 1876-1100 |
Abstract
The construction of fault-tolerant graphs is a trade-off between costs and degree of fault-tolerance. Thus the construction of such graphs can be viewed as a two-criteria optimization problem. Any algorithm therefore should be able to generate a Pareto-front of graphs so that the right graph can be chosen to match the application and the user’s need. In this work algorithms from three different domains for the construction of fault-tolerant graphs are evaluated. Classical graph-theoretic algorithms, optimization and bio-inspired approaches are compared regarding the quality of the generated graphs as well as concerning the runtime requirements. As result, recommendations for the application of the right algorithm for a certain problem class can be concluded.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Wirtschaftsingenieurwesen und Fertigungstechnik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Information Science and Applications. 2015. S. 1033-1041 (Lecture Notes in Electrical Engineering; Band 339).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Evaluating heuristic optimization, bio-inspired and graph-theoretic algorithms for the generation of fault-tolerant graphs with minimal costs
AU - Becker, Matthias
AU - Krömker, Markus
AU - Szczerbicka, Helena
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2015.
PY - 2015/2/18
Y1 - 2015/2/18
N2 - The construction of fault-tolerant graphs is a trade-off between costs and degree of fault-tolerance. Thus the construction of such graphs can be viewed as a two-criteria optimization problem. Any algorithm therefore should be able to generate a Pareto-front of graphs so that the right graph can be chosen to match the application and the user’s need. In this work algorithms from three different domains for the construction of fault-tolerant graphs are evaluated. Classical graph-theoretic algorithms, optimization and bio-inspired approaches are compared regarding the quality of the generated graphs as well as concerning the runtime requirements. As result, recommendations for the application of the right algorithm for a certain problem class can be concluded.
AB - The construction of fault-tolerant graphs is a trade-off between costs and degree of fault-tolerance. Thus the construction of such graphs can be viewed as a two-criteria optimization problem. Any algorithm therefore should be able to generate a Pareto-front of graphs so that the right graph can be chosen to match the application and the user’s need. In this work algorithms from three different domains for the construction of fault-tolerant graphs are evaluated. Classical graph-theoretic algorithms, optimization and bio-inspired approaches are compared regarding the quality of the generated graphs as well as concerning the runtime requirements. As result, recommendations for the application of the right algorithm for a certain problem class can be concluded.
KW - Bio-inspired algorithm
KW - Fault-tolerant graphs
KW - Graph optimization
UR - http://www.scopus.com/inward/record.url?scp=84923166127&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-46578-3_123
DO - 10.1007/978-3-662-46578-3_123
M3 - Conference contribution
AN - SCOPUS:84923166127
SN - 978-3-662-46577-6
T3 - Lecture Notes in Electrical Engineering
SP - 1033
EP - 1041
BT - Information Science and Applications
ER -