Approximation Algorithms for Finding Highly Connected Subgraphs
| dc.contributor.author | Khuller, Samir | en_US |
| dc.date.accessioned | 2004-05-31T22:29:45Z | |
| dc.date.available | 2004-05-31T22:29:45Z | |
| dc.date.created | 1995-01 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | (Also cross-referenced as UMIACS-TR-95-4) | en_US |
| dc.format.extent | 359746 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/689 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3398 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-95-4 | en_US |
| dc.title | Approximation Algorithms for Finding Highly Connected Subgraphs | en_US |
| dc.type | Technical Report | en_US |