3 citations · 3 across the 1 of their papers we have counts for
3 papers · 1 filter
Algorithms and Hardness Results for the -Cover Problem
Amirali Madani, Anil Maheshwari, Babak Miraftab +1
A connected graph has a -cover if each of its edges is contained in at least cliques of order . Motivated by recent advances in extremal combinatorics and the l…
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely stu…
On Approximating the Dynamic and Discrete Network Flow Problem
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of…