Pages that link to "Item:Q1586139"

The following pages link to Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139):

Displaying 1 item.

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