Pages that link to "Item:Q3638885"

The following pages link to A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem (Q3638885):

Displaying 23 items.

• Approximating the maximum multiple RNA interaction problem (Q300233) (← links)
• Exponential approximation schemata for some network design problems (Q396669) (← links)
• Multi-criteria TSP: Min and Max combined (Q433836) (← links)
• A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
• Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
• On the maximum TSP with \(\gamma\)-parameterized triangle inequality (Q691373) (← links)
• Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
• Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
• A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← 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)
• Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
• Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
• Approximation Algorithms for the Maximum Multiple RNA Interaction Problem (Q2867107) (← links)
• Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
• (Q3115273) (← links)
• A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (Q4973249) (← links)
• A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
• A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)
• Optimizing Read Reversals for Sequence Compression (Q5283828) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)