Solving Subgraph Extraction Problems Using $\hat{I}”$Search

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…