Pages that link to "Item:Q414457"

The following pages link to Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457):

Displaying 2 items.

• Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
• A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)