Abstract
Heaviest k-Subgraph problem is to detect a subgraph of k vertices from a given undirected weighted graph G such that the sum of the weights of the edges of k vertices is maximum. Finding heaviest k-subgraph is a NP-hard problem in the literature. We have proposed an approach for approximating the solution of heaviest k-subgraph in which greedy approach is used to reduce the size of a graph which is used as input for branch and bound implementation of the heaviest k-subgraph problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
A.V. Goldberg, Finding a maximum density subgraph. Technical report (1984)
M. Letsios, O.D. Balalau, M. Danisch, E. Orsini, M. Sozio, Finding heaviest k-subgraphs and events in social media, in 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW), Barcelona (2016), pp. 113–120
Y. Asahiro, K. Iwama, H. Tamaki, T. Tokuyama, Greedily finding a dense subgraph. J. Algorithms 34(2), 203–221 (2000)
U. Feige, The Dense k-Subgraph Problem 1 Introduction (1999)
D. Papailiopoulos, I. Mitliagkas, A. Dimakis, C. Caramanis, Finding dense subgraphs via low-rank bilinear optimization, in Proceedings of the 31st International Conference on Machine Learning (ICML-14) (2014), pp. 1890–1898
S. Khuller, B. Saha, On finding dense subgraphs, in Icalp, vol 5555 (2009), pp. 597–608
M. Charikar, Greedy approximation algorithms for finding dense components in a graph, in Approximation Algorithms for Combinatorial Optimization (2000), pp. 84–95
N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.T. Paschos. Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. 262, 894–903
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Singh, H., Kumar, M., Aggarwal, P. (2019). Approximation of Heaviest k-Subgraph Problem by Size Reduction of Input Graph. In: Krishna, C., Dutta, M., Kumar, R. (eds) Proceedings of 2nd International Conference on Communication, Computing and Networking. Lecture Notes in Networks and Systems, vol 46. Springer, Singapore. https://doi.org/10.1007/978-981-13-1217-5_58
Download citation
DOI: https://doi.org/10.1007/978-981-13-1217-5_58
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1216-8
Online ISBN: 978-981-13-1217-5
eBook Packages: EngineeringEngineering (R0)