The dense k-subgraph problem

U. Feige; G. Kortsarz; D. Peleg

doi:10.1007/s004530010050

The dense k-subgraph problem

U. Feige
, G. Kortsarz
, D. Peleg

Weizmann Institute of Science
Open University of Israel

Research output: Contribution to journal › Article › peer-review

451 Scopus citations

Abstract

This paper considers the problem of computing the dense k-vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n^δ), for some δ < 1/3.

Original language	English
Pages (from-to)	410-421
Number of pages	12
Journal	Algorithmica
Volume	29
Issue number	3
DOIs	https://doi.org/10.1007/s004530010050
State	Published - Mar 2001
Externally published	Yes

Keywords

Approximation algorithms
Dense subgraph

Access to Document

10.1007/s004530010050

Cite this

@article{9f41e7f180f1453781ec597daf3dc015,

title = "The dense k-subgraph problem",

abstract = "This paper considers the problem of computing the dense k-vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(nδ), for some δ < 1/3.",

keywords = "Approximation algorithms, Dense subgraph",

author = "U. Feige and G. Kortsarz and D. Peleg",

year = "2001",

month = mar,

doi = "10.1007/s004530010050",

language = "אנגלית",

volume = "29",

pages = "410--421",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - The dense k-subgraph problem

AU - Feige, U.

AU - Kortsarz, G.

AU - Peleg, D.

PY - 2001/3

Y1 - 2001/3

N2 - This paper considers the problem of computing the dense k-vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(nδ), for some δ < 1/3.

AB - This paper considers the problem of computing the dense k-vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(nδ), for some δ < 1/3.

KW - Approximation algorithms

KW - Dense subgraph

UR - https://www.scopus.com/pages/publications/0005259971

U2 - 10.1007/s004530010050

DO - 10.1007/s004530010050

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0005259971

SN - 0178-4617

VL - 29

SP - 410

EP - 421

JO - Algorithmica

JF - Algorithmica

IS - 3

ER -

The dense k-subgraph problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this