Dense subgraph problems with output-density conditions

Akiko Suzuki, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


We consider the dense subgraph problem that extracts a subgraph with a prescribed number of vertices that has the maximum number of edges (total edge weight in the weighted case) in a given graph. We give approximation algorithms with improved theoretical approximation ratios-assuming that the density of the optimal output subgraph is high, where density is the ratio of number of edges (or sum of edge weights) to the number of edges in the clique on the same number of vertices. Moreover, we investigate the case where the input graph is bipartite, and design a pseudo-polynomial time approximation scheme that can become a PTAS even if the size of the optimal output graph is comparatively small. This is a significant improvement in a theoretical sense, since no constant-ratio approximation algorithm was known previously if the output graph has o(n) vertices.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings
PublisherSpringer Verlag
Number of pages11
ISBN (Print)3540309357, 9783540309352
Publication statusPublished - 2005
Event16th International Symposium on Algorithms and Computation, ISAAC 2005 - Hainan, China
Duration: 2005 Dec 192005 Dec 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3827 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other16th International Symposium on Algorithms and Computation, ISAAC 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Dense subgraph problems with output-density conditions'. Together they form a unique fingerprint.

Cite this