Quest for Good Spanners of Hypercubes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10390184" target="_blank" >RIV/00216208:11320/18:10390184 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/8477825/" target="_blank" >https://ieeexplore.ieee.org/document/8477825/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CEC.2018.8477825" target="_blank" >10.1109/CEC.2018.8477825</a>
Alternative languages
Result language
angličtina
Original language name
Quest for Good Spanners of Hypercubes
Original language description
The quest for good spanners of hypercubes is motivated by their usage as network architectures. Spanners that keep short distances while reducing size or that offer multiple edge-disjoint paths between nodes are favoured. In particular, a 3-spanner guarantees that neighbours in the original graph remain within distance 3 in the spanner. There are known constructions of sparse 3-spanners of hypercubes but they are inefficient for small dimensions. We show two constructions efficient for small dimensions, which improve previously known upper bound on the minimal size of hypercube 3-spanners. We present a genetic algorithm with new hypercube-specific operators and fitness functions addressing the problems of finding a 3-spanner of minimal size and finding multiple edge-disjoint spanners. We evaluate it over a variety of settings and emphasize the most notable ones. For small dimensions the computed results match the new improved constructions this paper presents and for higher dimensions they exceed previously known results.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2018 IEEE Congress on Evolutionary Computation (CEC)
ISBN
978-1-5090-6017-7
ISSN
—
e-ISSN
neuvedeno
Number of pages
8
Pages from-to
1-8
Publisher name
IEEE
Place of publication
Neuveden
Event location
Rio de Janeiro, Brazil
Event date
Jul 8, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000451175500058