Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
This paper surveys some recent developments in the application of combinatorial optimization to VLSI design. We focus on integer programs arising in wire routing and PLA partitioning. Typically, the integer programs we are interested in are computationally difficult. We present approaches to approximately solving them by rounding the solutions to the relaxed linear programs. The resulting algorithms run in polynomial time and have provable performance guarantees. We also introduce the notion of multiterminal multicommodity flows, and point out their relevance to VLSI routing. © 1992.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
A.R. Conn, Nick Gould, et al.
Mathematics of Computation