On the Complexity of Combinatorial Optimization on Fixed Structures

Nimrod Megiddo

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems…