The following pages link to (Q5417632):
Displayed 43 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- Multi-criteria TSP: Min and Max combined (Q433836) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Quell (Q500997) (← links)
- The directed orienteering problem (Q547309) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Thin trees in 8-edge-connected planar graphs (Q1711432) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- On the core of traveling salesman games (Q1785381) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- Thin trees in some families of distance-regular graphs (Q4965921) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Generalized maximum entropy estimation (Q5214230) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- (Q5743405) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- A deterministic better-than-3/2 approximation algorithm for metric TSP (Q6086006) (← links)