A Deterministic Approximation Algorithm for the Densest K-subgraph Problem

@inproceedings{CEDRIC2006ADA,
  title={A Deterministic Approximation Algorithm for the Densest K-subgraph Problem},
  author={CEDRIC and CNAM-IIE},
  year={2006}
}
  • CEDRIC, CNAM-IIE
  • Published 2006
In the Densest k-Subgraph problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1, ..., vn). We seek to find a subset of k vertices (k belonging to {1, ..., n}) which maximizes the number of edges which have their two endpoints in the subset. This problem is NP-hard even for bipartite graphs, and no polynomial-time algorithm with a fixed performance guarantee is known for the general case. Several authors have proposed randomized approximation algorithms for… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Approximation of Dense-k-Subgraph’, Working Paper, Department of Management Sciences, Henry B

  • Han, Y. Q. Ye, J. Zhang
  • Tippie College of Business,
  • 2000
Highly Influential
6 Excerpts

Derandomization in Combinatorial Optimization

  • A. Srivastav
  • In Handbook of Randomized Computing, Volume II…
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…