5 citations · 17 across the 14 of their papers we have counts for
6 papers · 1 filter
The Price of Privacy For Approximating Max-CSP
Prathamesh Dharangutte, Jingcheng Liu, Pasin Manurangsi +3
We study approximation algorithms for Maximum Constraint Satisfaction Problems (Max-CSPs) under differential privacy (DP) where the constraints are considered sensitive data. Infor…
Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
Robert R. Nerem, Zhishang Luo, Akbar Rafiey +1
Continuously extending combinatorial optimization objectives is a powerful technique commonly applied to the optimization of set functions. However, few such methods exist for exte…
Decomposable Submodular Maximization in Federated Setting
Akbar Rafiey
Submodular functions, as well as the sub-class of decomposable submodular functions, and their optimization appear in a wide range of applications in machine learning, recommendati…
Sparsification of Decomposable Submodular Functions
Akbar Rafiey, Yuichi Yoshida
Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are su…
Fast and Private Submodular and -Submodular Functions Maximization with Matroid Constraints
Akbar Rafiey, Yuichi Yoshida
The problem of maximizing nonnegative monotone submodular functions under a certain constraint has been intensively studied in the last decade, and a wide range of efficient approx…
Toward a Dichotomy for Approximation of -coloring
Akbar Rafiey, Arash Rafiey, Thiago Santos
Given two (di)graphs G, H and a cost function , in the minimum cost homomorphism problem, MinHOM(H), goal is finding a hom…