Greedily Finding a Dense Subgraph
Authors:
- Yuichi AsahiroYAYuichi Asahiro
- Kazuo IwamaKIKazuo Iwama
- Hisao TamakiHTHisao Tamaki
- Takeshi TokuyamaTTTakeshi Tokuyama
- 1 February 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (2) , 203-221
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On choosing a dense subgraph2002
- Polynomial Time Approximation Schemes for Dense Instances of NP-Hard ProblemsJournal of Computer and System Sciences, 1999
- Generating Sparse 2-SpannersJournal of Algorithms, 1994
- Heuristic and Special Case Algorithms for Dispersion ProblemsOperations Research, 1994
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988