On the computational complexity of optimization convex covering problems of graphs

zbMath1445.68107MaRDI QIDQ2209473

Radu Buzatu

Publication date: 2 November 2020

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v28-n2/13182/

zbMATH Keywords

NP-hardnessconvex partitionconvex cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Unnamed Item

This page was built for publication: On the computational complexity of optimization convex covering problems of graphs