Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 235-246
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation2014
- Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses2013
- Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More2013
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest CutSIAM Journal on Computing, 2011
- Confluent Layered DrawingsAlgorithmica, 2007
- Approximating Maximum Clique by Removing SubgraphsSIAM Journal on Discrete Mathematics, 2004
- Relations between average case complexity and approximation complexity2002
- FA Minimisation Heuristics for a Class of Finite LanguagesLecture Notes in Computer Science, 2001
- Graph Classes: A Survey1999
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphsDiscrete Applied Mathematics, 1998