Approximation Algorithms for the k-Clique Covering Problem
From MaRDI portal
Publication:4895634
DOI10.1137/S089548019325232XzbMath0857.05086MaRDI QIDQ4895634
Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu, Cor A. J. Hurkens
Publication date: 26 February 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the Approximability of the Minimum Weight $t$-partite Clique Problem, Bin Packing with Colocations, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Design of test inputs and their sequences in multi-function system testing, Three perspectives for solving the job grouping problem, Covering arrays avoiding forbidden edges
