Pages that link to "Item:Q4732318"

The following pages link to Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318):

Displaying 4 items.

• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)
• An integer programming formulation of the Steiner problem in graphs (Q4031973) (← links)
• Continuous approximation formulas for location problems (Q6085881) (← links)