Approximation algorithms for connected maximum cut and related problems
- Mohammad Taghi Hajiaghayi
- Guy Kortsarz
- et al.
- 2020
- Theoretical Computer Science
Publications
4 results for Manish Purohit
Analyzing the optimal neighborhood: Algorithms for partial and budgeted connected dominating set problems
- Samir Khuller
- Manish Purohit
- et al.
- 2020
- SIAM Journal on Discrete Mathematics
On maximum leaf trees and connections to connected maximum cut problems
- Rajiv Gandhi
- Mohammad Taghi Hajiaghayi
- et al.
- 2018
- Information Processing Letters
On the Approximability of Digraph Ordering
- Sreyash Kenkre
- Vinayaka Pandit
- et al.
- 2016
- Algorithmica