To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem.

@inproceedings{ruchansky-2017-connected, author = {Natali Ruchansky and Francesco Bonchi and David Garc\'{i}a-Soriano and Francesco Gullo and Nicolas Kourtellis}, editor = {Ee-Peng Lim and Marianne Winslett and Mark Sanderson and Ada Wai-Chee Fu and Jimeng Sun and J. Shane Culpepper and Eric Lo and Joyce C. Ho and Debora Donato and Rakesh Agrawal and Yu Zheng and Carlos Castillo and Aixin Sun and Vincent S. Tseng and Chenliang Li}, title = {{To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem}}, booktitle = {{Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, November 06 - 10, 2017}}, pages = {879--888}, publisher = {ACM}, year = {2017}, url = {https://doi.org/10.1145/3132847.3132991}, doi = {https://doi.org/10.1145/3132847.3132991} }