Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1272-1281
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Edge sets: an effective evolutionary coding of spanning treesIEEE Transactions on Evolutionary Computation, 2003
- Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem2003
- Multicasting in a linear lightwave network2002
- Permutation Optimization by Iterated Estimation of Random Keys Marginal Product FactorizationsLecture Notes in Computer Science, 2002
- Algorithms for a Simple Point Placement Problem2000
- Genetic Algorithms and Random Keys for Sequencing and OptimizationINFORMS Journal on Computing, 1994
- Compression of correlated bit-vectorsInformation Systems, 1991
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956