No. | Title | Author | Year |
---|---|---|---|

1 | The Weighted k-Center Problem in Trees for Fixed k | Bhattacharya, Binay et al. | 2019 |

2 | An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks | Bhattacharya, Binay et al. | 2018 |

3 | The p-Center Problem in Tree Networks Revisited | Banik, Aritra et al. | 2016 |

4 | k-delivery traveling salesman problem on tree networks | Bhattacharya, Binay et al. | 2012 |

Current Page :
| |

Number of result pages: | 1 |

Number of documents: | 4 |