| Presentation | 2004-10-14 Approximation algorithms for the bipartite dense subgraph problem Akiko SUZUKI, Takeshi TOKUYAMA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider the (weighted) bipartite dense subgraph problem that extracts a dense subgraph of a given (weighted) bipartite graph. We give approximation algorithms with theoretical error bounds even if the output subgraph is of small size provided that it is dense: This is significantly different from known results on the non-bipartite problem. We also discuss its application to dimension-reducing clustering in data mining applications. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Approximation Algorithm / Clustering / Dense subgraph |
| Paper # | COMP2004-37 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2004/10/7(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Approximation algorithms for the bipartite dense subgraph problem |
| Sub Title (in English) | |
| Keyword(1) | Approximation Algorithm |
| Keyword(2) | Clustering |
| Keyword(3) | Dense subgraph |
| 1st Author's Name | Akiko SUZUKI |
| 1st Author's Affiliation | GSIS Tohoku University() |
| 2nd Author's Name | Takeshi TOKUYAMA |
| 2nd Author's Affiliation | GSIS Tohoku University |
| Date | 2004-10-14 |
| Paper # | COMP2004-37 |
| Volume (vol) | vol.104 |
| Number (no) | 338 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |