Pages that link to "Item:Q3546300"

The following pages link to Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs (Q3546300):

Displaying 48 items.

• The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
• A probabilistic PTAS for shortest common superstring (Q393897) (← links)
• Exponential approximation schemata for some network design problems (Q396669) (← links)
• Multi-criteria TSP: Min and Max combined (Q433836) (← links)
• The minimum spanning tree problem with non-terminal set (Q456089) (← links)
• Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
• 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544) (← links)
• Reoptimization of the shortest common superstring problem (Q639296) (← links)
• Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
• LP-based solution methods for the asymmetric TSP (Q845937) (← links)
• On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• Analysis of set-up time models: a metric perspective (Q935161) (← links)
• The on-line asymmetric traveling salesman problem (Q935844) (← links)
• Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
• Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
• Minimum-weight cycle covers and their approximability (Q1028118) (← links)
• On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
• Approximating the minimum tour cover of a digraph (Q1736480) (← links)
• Maximum ATSP with weights zero and one via half-edges (Q1743116) (← links)
• Complexity of the directed spanning cactus problem (Q1765377) (← links)
• Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
• An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
• Motion planning algorithms for the Dubins Travelling Salesperson Problem (Q2409439) (← links)
• Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
• TSP with bounded metrics (Q2495398) (← links)
• No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
• (Q2861493) (← links)
• Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
• Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
• Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
• Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality (Q3183477) (← links)
• An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
• Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
• Approximating Multi-criteria Max-TSP (Q3541086) (← links)
• Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
• A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (Q4973249) (← links)
• Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
• A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
• APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
• A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)