Some properties of the alternating separation (AS) and ASAP algorithm
From MaRDI portal
Publication:866091
zbMATH Open1186.94304MaRDI QIDQ866091FDOQ866091
Authors: Chao Shao, Guangyue Lu, Zheng Bao 
Publication date: 20 February 2007
Published in: Science in China. Series F (Search for Journal in Brave)
Recommendations
- On the asymptotic behavior of some algorithms
- A faster version of the ASG algorithm
- Approximation algorithms for the partial assignment problem
- An acceleration property of the \(E\)-algorithm for alternate sequences
- Asymptotic properties of collective-rearrangement algorithms
- An improved approximation algorithm for ATSP
- A remark on the alternating algorithm
- Tight approximation algorithms for maximum separable assignment problems
- scientific article; zbMATH DE number 4152174
Point estimation (62F10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods in Fourier analysis (65T99)
This page was built for publication: Some properties of the alternating separation (AS) and ASAP algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866091)
