Pages that link to "Item:Q4512573"

The following pages link to A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573):

Displaying 1 item.

• Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)