Pages that link to "Item:Q5360842"

The following pages link to An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5360842):

Displaying 17 items.

• The indefinite period traveling salesman problem (Q724039) (← links)
• Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
• From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
• The simultaneous semi-random model for TSP (Q2164675) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
• On the Computability of Continuous Maximum Entropy Distributions with Applications (Q5048289) (← links)
• Efficient Large-Scale Multi-Drone Delivery using Transit Networks (Q5856479) (← links)
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
• Maximum entropy and integer partitions (Q5886264) (← links)
• The temporal explorer who returns to the base (Q5918316) (← links)
• From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
• 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)
• The simultaneous semi-random model for TSP (Q6589752) (← links)
• Matroid-based TSP rounding for half-integral solutions (Q6589761) (← links)
• A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees (Q6646407) (← links)