The following pages link to (Q4461909):
Displaying 8 items.
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Hamiltonian completions of sparse random graphs (Q2576345) (← links)
- Probabilistic analysis of optimization problems on generalized random shortest path metrics (Q2662688) (← links)
- A concentration inequality for the facility location problem (Q2670506) (← links)
- The snake for visualizing and for counting clusters in multivariate data (Q4969720) (← links)
- Probabilistic analysis of optimization problems on sparse random shortest path metrics (Q6088299) (← links)
- Approximation ineffectiveness of a tour-untangling heuristic (Q6574920) (← links)
