8 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.CG2024
A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
Md. Musfiqur Rahman Sanim, Safrunnesa Saira, Fatin Faiaz Ahsan +2
Given a n points in two dimensional space, a Manhattan Network G is a network that connects all n points with either horizontal or vertical edges, with the property that for any tw…
cs.DM2014★ 8 cited
An Integer Programming Formulation of the Minimum Common String Partition problem
S. M. Ferdous, M. Sohel Rahman
We consider the problem of finding a minimum common partition of two strings (MCSP). The problem has its application in genome comparison. MCSP problem is proved to be NP-hard. In…
cs.AI2014★ 2 cited
Solving the Minimum Common String Partition Problem with the Help of Ants
S. M. Ferdous, M. Sohel Rahman
In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete com…