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.
- MP or not MP: that is the question (Q283264) (← links)
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On testing Hamiltonicity of graphs (Q468434) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- The checkpoint problem (Q714790) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem (Q1884968) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
