6 citations · 8 across the 3 of their papers we have counts for
3 papers
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi, MohammadHossein Bateni, Vahab Mirrokni
Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distribut…
Categorical Feature Compression via Submodular Optimization
MohammadHossein Bateni, Lin Chen, Hossein Esfandiari +3
In the era of big data, learning from categorical features with very large vocabularies (e.g., 28 million for the Criteo click prediction dataset) has become a practical challenge…
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat
Moss and Rabani[12] study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or penalty). They gi…