13 citations · 13 across the 4 of their papers we have counts for
4 papers
Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem
Farzane Yahyanejad, Bahram Sadeghi Bigham
The Hop-Constrained Steiner Tree problem (HCST) is challenging NP-hard problem arising in the design of centralized telecommunication networks where the reliability constraints mat…
Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location
Farzane Yahyanejad, Bahram Sadeghi Bigham
We present a simple, robust and efficient harmony search algorithm for the Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL problem is NP-hard that models…
Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad
problems (also called - problems) have been studied in data mining, statistics and computer science over the last several decades i…
Effect of Gromov-hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
Bhaskar DasGupta, Marek Karpinski, Nasim Mobasheri +1
-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed , such graphs are simply called hyperbolic graphs and include…