On the Approximability of the Minimum Weight t-partite Clique Problem
| Autor: | Geoffrey A. Solano, Jaime D. L. Caro, Jhoirene B. Clemente, Guillaume Blin, Mathieu Raffinot |
|---|---|
| Přispěvatelé: | Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
General Computer Science
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] Minimum weight 0102 computer and information sciences 01 natural sciences Computer Science Applications Theoretical Computer Science Combinatorics Computational Theory and Mathematics Clique problem 010201 computation theory & mathematics Geometry and Topology ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | Journal of Graph Algorithms and Applications Journal of Graph Algorithms and Applications, Brown University, 2020, 24 (3), pp.171-190. ⟨10.7155/jgaa.00525⟩ |
| ISSN: | 1526-1719 |
| DOI: | 10.7155/jgaa.00525⟩ |
| Popis: | International audience |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|