Pages that link to "Item:Q4697080"
From MaRDI portal
The following pages link to The Traveling Salesman Problem with Distances One and Two (Q4697080):
Displaying 50 items.
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- Adversarial patrolling with spatially uncertain alarm signals (Q2407886) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Approximation algorithms for the scaffolding problem and its generalizations (Q2636507) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- On Interference Graphs (Q2839250) (← links)
- (1,2)-HAMILTONIAN COMPLETION ON A MATCHING (Q2841988) (← links)
- (Q2861493) (← links)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Approximation performance of ant colony optimization for the TSP(1,2) problem (Q2957749) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Approximating Alternative Solutions (Q3511329) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
- Better Approximation Algorithms for Scaffolding Problems (Q4632165) (← links)
- TRAVELING SALESMAN PROBLEM OF SEGMENTS (Q4818594) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- On the number of<i>k</i>-cycles in the assignment problem for random matrices (Q5239474) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- (Q5874481) (← links)
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem (Q5950645) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)
