Complexity Analysis of 2-Heterogeneous Minimum Spanning Forest Problem

TL;DR

This paper proves that the 2-heterogeneous minimum spanning forest problem is NP-hard by reducing 3-SAT, establishing its computational complexity and providing a foundation for future approximation algorithm development.

Contribution

It establishes the NP-hardness of the 2-heterogeneous minimum spanning forest problem through a reduction from 3-SAT, filling a gap in complexity knowledge.

Findings

Proves NP-hardness of the problem.

Reduces 3-SAT to the problem.

Provides theoretical basis for approximation algorithms.

Abstract

For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem to prove this problem is NP-hard and spread result to general problem, which determines complexity of this problem. It provides a theoretical basis for the future designing of approximation algorithms for the problem.