Task swapping networks in distributed systems
From MaRDI portal
Publication:2874305
DOI10.1080/00207160.2013.772985zbMath1311.68027arXiv1107.1851OpenAlexW2035239726MaRDI QIDQ2874305
Publication date: 29 January 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1851
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Machine scheduling with resource dependent processing times
- Minimal factorizations of permutations into star transpositions
- The complexity of finding minimum-length generator sequences
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
- An approximation algorithm for the generalized assignment problem
- Task assignment in Cayley interconnection topologies
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Reduced decompositions and permutation patterns
- Combinatorics of Coxeter Groups
- Assignment Problems
- A group-theoretic model for symmetric interconnection networks
- New classes of interconnection topology structures and their properties
- Algebraic Graph Theory
- Permutations as Products of Transpositions
- On the representation of permutations as products of transpositions
This page was built for publication: Task swapping networks in distributed systems