Author:
Srivastav Anand,Wolf Katja
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization 5(1): 13–51, 1995.
2. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science, 1097, pages 136–148, Springer-Verlag, 1996.
3. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 284–293, 1995.
4. B. Chandra and M.M. Halldórsson. Facility dispersion and remote subgraphs. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science, 1097, pages 53–65, Springer-Verlag, 1996.
5. P. Crescenzi and V. Kann. A compendium of NP optimization problems. Technical report SI/RR-95/02, Dipartimento di Scienze dell'Informazione, Università di Roma “La Sapienza”. The problem list is continuously updated and available as http://www.nada.kth.se/theory/problemlist.html.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms for Densest Subgraphs of Vertex-Weighted Graphs;Mathematics;2024-07-14
2. Cardinality-Constrained Binary Quadratic Optimization via Extreme Point Pursuit, with Application to the Densest K-Subgraph Problem;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14
3. Adversaries with Limited Information in the Friedkin-Johnsen Model;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04
4. Sum-of-Squares Lower Bounds for Densest k-Subgraph;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Exploring the Subgraph Density-Size Trade-off via the Lovaśz Extension;Proceedings of the 14th ACM International Conference on Web Search and Data Mining;2021-03-08