Approximating the Minimum Biclique Cover Problem on Bipartite Graphs

Local TagsRelease HistoryDetailsSummary

Approximating the Minimum Biclique Cover Problem on Bipartite Graphs

Heydrich, S. (2014). Approximating the Minimum Biclique Cover Problem on Bipartite Graphs. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-07B5-9 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-07B6-7

Genre: Thesis

show

show

hide

Creators:
Heydrich, Sandy¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Accepted: 2014Date issued: 2014

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: HeydrichMaster2014

Degree: Master

show

show

show

show