Pages that link to "Item:Q5144891"
From MaRDI portal
The following pages link to An improved approximation algorithm for ATSP (Q5144891):
Displaying 18 items.
- Some properties of the alternating separation (AS) and ASAP algorithm (Q866091) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← 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)
- 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)
- (Q4414638) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313047) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Auction algorithm sensitivity for multi-robot task allocation (Q6066800) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← 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)
