Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Paper
A note on maximizing a submodular set function subject to a knapsack constraint
Abstract
A note on maximizing a submodular set function subject to a knapsack constraint was presented. An (1-e-1)-approximation algorithm for maximizing a nondecreasing submodular set function was obtained. This algorithm required O(n5) function value computations. The algorithm enumerated all feasible solutions of cardinality one or two.
Related
Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics