Pages that link to "Item:Q5230290"
From MaRDI portal
The following pages link to A constant-factor approximation algorithm for the asymmetric traveling salesman problem (Q5230290):
Displaying 20 items.
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Minimizing the makespan on a single machine subject to modular setups (Q2124915) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Approximation Algorithms for the Single Robot Line Coverage Problem (Q3382005) (← links)
- Thin trees in some families of distance-regular graphs (Q4965921) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)
- The asymmetric traveling salesman path LP has constant integrality ratio (Q5918918) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
