scientific article; zbMATH DE number 2064410
From MaRDI portal
Publication:4461909
Cited in
(8)- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Hamiltonian completions of sparse random graphs
- A concentration inequality for the facility location problem
- The snake for visualizing and for counting clusters in multivariate data
- Probabilistic analysis of optimization problems on sparse random shortest path metrics
- Approximation ineffectiveness of a tour-untangling heuristic
- Performance of efficient variants of the 2-opt heuristic for the traveling salesperson problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4461909)