On Finite Dimension Exchange Algorithms

DOI10.1002/1617-7061(200203)1:1%3C500::AID-PAMM500%3E3.0.CO;2-ZMaRDI QIDQ3510762zbMATH OpenOpenAlexFDO

Authors Holger Arndt

Publication date 3 July 2008

Full work available at URL https://doi.org/10.1002/1617-7061(200203)1:1%3C500::aid-pamm500%3E3.0.co;2-z

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel numerical computation (65Y05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On finite dimension exchange algorithms.
• On the theoretical properties of the exchange algorithm
• Two algorithms for the exchange lemma
• On the Approximability of Combinatorial Exchange Problems
• On the complexity of the exchange algorithm for minimax optimization problems
• Optimal algorithms for total exchange without buffering on the hypercube
• scientific article; zbMATH DE number 1432346
• Total exchange algorithms on 'sandwich graphs'
• On the implementation of combinatorial algorithms for the linear exchange market
• On the complexity of exchanging

Cited in

(7)

• On the representation theorem for exchangeable arrays
• Analysis of the generalized dimension exchange method for dynamic load balancing
• On finite dimension exchange algorithms.
• On the theoretical properties of the exchange algorithm
• Bulge Exchanges in Algorithms of QR Type
• scientific article; zbMATH DE number 967422 (Why is no real title available?)
• The influence of graph structure on generalized dimension exchange

This page was built for publication: On Finite Dimension Exchange Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510762)