Abstract
Given an n-vertex graph with non-negative edge weights and a positive integer k ≤ n, we are to find a k-vertex subgraph with the maximum weight. We study the following greedy algorithm for this problem: repeatedly remove a vertex with the minimum weighted-degree in the currently remaining graph, until exactly k vertices are left. We derive tight bounds on the worst case approximation ratio R of this greedy algorithm: (1/2+n/(2k))2-O(1/n) ≤ R ≤ (1/2+n/(2k))2+O(1/n) for k in the range n/3 ≤ k ≤ n and 2(n/k − 1) − O(1/k) ≤ R ≤ 2(n/k − 1) + O(n/k 2) for k<n/3. For k = n/2, for example, these bounds are 9/4+=O(1/n), improving on naive lower and upper bounds of 2 and 4 respectively. The upper bound for general k shows that this simple algorithm is better than the best previously known algorithm at least by a factor of 2 when k ≥ n 11/18.
Research supported in part by Science Research Grant, Ministry of Education, Japan, No. 07458061
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. Asahiro and K. Iwama. Finding dense subgraphs. Proc. International Symposium on Algorithms and Computation '95, Lecture Notes in Computer Science 1004, 102–111, 1995
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Proc. 27th ACM Symposium on Theory of Computing, 284–293, 1995.
M. Grötschel and L. Lovàsz. Combinatorial Optimization: A Survey. In Handbook of Combinatorics, North-Holland, 1995.
G. Kortsarz and D. Peleg. Generating sparse 2-spanners. Proc. 3rd Scandinavian Workshop on Algorithm Theory, 73–82, 1992.
G. Kortsarz and D. Peleg. On choosing a dense subgraph. Proc. 34th IEEE Symposium on Foundations of Computer Science, 692–701, 1993.
P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37:130–143, 1988.
S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi. Facility dispersion problems: Heuristics and special cases. In Proc. 2nd Workshop on Algorithms and Data Structures, LNCS-519, 355–366, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T. (1996). Greedily finding a dense subgraph. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_127
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_127
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive