Author:
Liazi Maria,Milis Ioannis,Pascual Fanny,Zissimopoulos Vassilis
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference20 articles.
1. Arora S, Karger D, Karpinski M (1995) Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proceedings of the 27th annual ACM symposium on theory of computing, pp 284–293
2. Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34(2):203–221
3. Billionnet A, Roupin F (2004) A deterministic algorithm for the densest k-subgraph problem using linear programming. Technical Report No. 486, CEDRIC, CNAM-IIE, Paris
4. Corneil DG, Perl Y (1984) Clustering and domination in perfect graphs. Discret Appl Math 9:27–39
5. Feige U, Kortsarz G, Peleg D (2001) The dense k-subgraph problem. Algorithmica 29(3):410–421
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献