M
MohammadTaghi Hajiaghayi
Researcher at University of Maryland, College Park
Publications - 404
Citations - 12400
MohammadTaghi Hajiaghayi is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Approximation algorithm & 1-planar graph. The author has an hindex of 57, co-authored 377 publications receiving 11276 citations. Previous affiliations of MohammadTaghi Hajiaghayi include Massachusetts Institute of Technology & Indian Institutes of Technology.
Papers
More filters
Proceedings ArticleDOI
The polarizing effect of network influences
TL;DR: This work considers a model recently studied to model cascading behavior when members of a social network must each choose one of two opposing ideas and derives bounds that are robust to certain types of correlation between the personal preferences of agents, allowing for the results to be applied to a wider range of settings than prior works which required complete independence between individuals.
Journal ArticleDOI
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
Rajesh Chitnis,Hossein Esfandiari,MohammadTaghi Hajiaghayi,Rohit Khandekar,Guy Kortsarz,Saeed Seddighin +5 more
TL;DR: This paper investigates the computational complexity of a variant of 2-SCSS where the authors have demands for the number of paths between each terminal pair and relies on a structural result regarding an optimal solution followed by using the idea of a “token game” similar to that of Feldman and Ruhl.
Book ChapterDOI
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
Rajesh Chitnis,Hossein Esfandiari,MohammadTaghi Hajiaghayi,Rohit Khandekar,Guy Kortsarz,Saeed Seddighin +5 more
TL;DR: The problem is NP-hard, but Feldman and Ruhl gave a novel \(n^{O(p)}\) algorithm for the \(p\)-SCSS problem.
Journal ArticleDOI
Plane Embeddings of Planar Graph Metrics
TL;DR: It is proved that all outerplanar graph metrics can be embedded into the plane with $O(\sqrt n)$ distortion, generalizing the previous results on trees (both the worst-case bound and the approximation algorithm) and building techniques for handling cycles in plane embeddings of graph metrics.
Posted Content
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
TL;DR: The first polynomial-time approximation scheme for the Steiner forest problem on planar graphs and on graphs of bounded genus was given in this article, where the authors showed how to build a Steiner tree spanner for such graphs.