Pages that link to "Item:Q464901"

The following pages link to On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901):

Displaying 1 item.

• Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)