Inapproximability of the Minimum Biclique Edge Partition Problem

IEICE Transactions on Information and Systems - Japan
doi 10.1587/transinf.e93.d.290
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

On the Minimum Common Integer Partition Problem

ACM Transactions on Algorithms
Mathematics
2008English

A Heuristic for the Minimum Cost Chromatic Partition Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2020English

An Integer Programming Formulation of the Minimum Common String Partition Problem

PLoS ONE
Multidisciplinary
2015English

An Edge-Based Crossover for the Capacitated Minimum Spanning Tree Problem

2016English

Fully Dynamic Quasi-Biclique Edge Covers via Boolean Matrix Factorizations

2013English

Balanced Partition of Minimum Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Minimum K-Cover Problem

Applied Mathematical Sciences
2013English

Simulation as Coarsest Partition Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy