Pages that link to "Item:Q6081704"

The following pages link to FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704):

Displaying 2 items.

• Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
• Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)