Das, M.Ambati, S.S.Chandrasekaran, K.2026-02-0620202020 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2020 - Proceedings, 2020, Vol., , p. 29-34https://doi.org/10.1109/DISCOVER50404.2020.9278058https://idr.nitk.ac.in/handle/123456789/30570This paper discusses the problem of finding a path to be blocked from the source to the destination for a vehicle to pass by in such a way that the traffic disruption caused is minimum. The traffic disruption caused by blocking a path is measured by estimating the number of vehicles that would have crossed any of the vertices in the path if the path had not been blocked. It also presents a heuristic algorithm 'Aggregate Traffic Minimization' (ATM) to solve the above problem. The traffic disruption caused by the path chosen by the ATM algorithm was compared with that of a popular baseline algorithm and was found that ATM outperforms the baseline alzorithm in most cases. © 2020 IEEE.Aggregate Traffic MinimizationATM algorithmFlow NetworkGraph AlgorithmPath Blocking