2 citations · 3 across the 8 of their papers we have counts for
9 papers
Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
Kiarash Banihashem, Jeff Giliberti, Samira Goudarzi +3
In this paper, we study the fundamental problems of maintaining the diameter and a -center clustering of a dynamic point set , where points may be insert…
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi +2
Constrained forest problems form a class of graph problems where specific connectivity requirements for certain cuts within the graph must be satisfied by selecting the minimum-cos…
Breaking a Long-Standing Barrier: 2- Approximation for Steiner Forest
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi +2
The Steiner Forest problem, also known as the Generalized Steiner Tree problem, is a fundamental optimization problem on edge-weighted graphs where, given a set of vertex pairs, th…
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi +2
We initiate the study of the submodular cover problem in dynamic setting where the elements of the ground set are inserted and deleted. In the classical submodular cover problem, w…
Prize-Collecting Steiner Tree: A 1.79 Approximation
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi +2
Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to conn…
Dynamic Non-monotone Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. More…
2-Approximation for Prize-Collecting Steiner Forest
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi +2
Approximation algorithms for the prize-collecting Steiner forest problem (PCSF) have been a subject of research for over three decades, starting with the seminal works of Agrawal,…
Dynamic Algorithms for Matroid Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial op…
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Maximizing a monotone submodular function under cardinality constraint is a core problem in machine learning and database with many basic applications, including video and data…