4 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Rebin Silva Valan Arasu, Rajiv Gupta
Many NP-hard graph problems can be modeled as optimal subgraph extraction problems with feasibility constraints. From Network Design to Facility Location, from Robotics to Graph Dr…