Efficient distributed approximation algorithms via probabilistic tree embeddings by Khan, Maleq., Kuhn, Fabian., Malkhi, Dahlia., Pandurangan, Gopal., Talwar, Kunal.

“…We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. …”
Get full text
Get full text

The primal-dual second-order cone approximations algorithm for symmetric cone programming by Chua, Chek Beng.

Get full text
Get full text

All-order correlation of single excitons in nanocrystals using a k . p envelope-function approach: application to lead-halide perovskites by Blundell, S. A., Guet, Claude

Subjects: Get full text

The cover number of a matrix and its algorithmic applications by Lee, Troy, Alon, Noga, Shraibman, Adi

Subjects: Get full text
Get full text

Approximating the double-cut-and-join distance between unsigned genomes by Chen, Xin, Sun, Ruimin, Yu, Jiadong

“…Finally, a polynomial-time approximation algorithm for the problem of sorting unsigned genomes by double-cut-and-join operations is devised, which achieves the approximation ratio 13/9 + e ≈ 1.4444 + e, for any positive ε. …”
Get full text
Get full text

Distributed verification and hardness of distributed approximation by Sarma, Atish Das., Holzer, Stephan., Kor, Liah., Korman, Amos., Nanongkai, Danupon., Pandurangan, Gopal., Peleg, David., Wattenhofer, Roger.

“…Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm for any approximation factor. …”
Get full text
Get full text

On approximate graph colouring and max-k-cut algorithms based on the θ-function by Klerk, Etienne de., Pasechnik, Dmitrii V., Warners, J. P.

“…In a related work, Karger et al. (1998) devised approximation algorithms for colouring k-colourable graphs exactly in polynomial time with as few colours as possible. …”
Get full text
Get full text