Exact and superpolynomial approximation algorithms for the densest k-subgraph problem-Reference-Cited by-同舟云学术

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem

Published:2017-11 Issue:3 Volume:262 Page:894-903
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bourgeois Nicolas,Giannakos Aristotelis,Lucarelli Giorgio^ORCID,Milis Ioannis,Paschos Vangelis Th.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference44 articles.

1. Finding dense subgraphs with size bounds;Andersen,2009

2. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora;Journal of Computer and System Sciences,1999

3. Complexity of finding dense subgraphs;Asahiro;Discrete Applied Mathematics,2002

4. Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs;Backer;Information Processing Letters,2010

5. Detecting high log-densities: An O(n1/4) approximation for densest k-subgraph;Bhaskara,2010

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing densest k-subgraph with structural parameters;Journal of Combinatorial Optimization;2022-12-23

2. Classifier Construction Under Budget Constraints;Proceedings of the 2022 International Conference on Management of Data;2022-06-10

3. A new heuristic for finding verifiable k-vertex-critical subgraphs;Journal of Heuristics;2022-01-24

4. On the Hardness and Approximation of the Densest $K$-Subgraph Problem in Parameterized Metric Graphs;SSRN Electronic Journal;2022

5. Complexity and approximability of the happy set problem;Theoretical Computer Science;2021-04