Author:
Georgakopoulos George F.,Politopoulos Kostas
Publisher
Oxford University Press (OUP)
Reference19 articles.
1. Free bits, PCPs and non-approximability—towards tight results;Bellare;SIAM J. Comput.,1998
2. Dense subgraph problems with output-density conditions;Suzuki,2005
3. The dense k-subgraph problem;Feige;Algorithmica,2001
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Density-Based Set Enumeration in Structured Data;Statistical and Machine Learning Approaches for Network Analysis;2012-06-21
2. A MAXIMUM DENSITY SUBSET PROBLEM AND ITS ALGORITHM WITH APPROXIMATE BINARY SEARCH;Transactions of the Operations Research Society of Japan;2010