Pages that link to "Item:Q3967062"
From MaRDI portal
The following pages link to The Travelling Salesman Problem and Minimum Matching in the Unit Square (Q3967062):
Displaying 14 items.
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- The physicist's approach to the travelling salesman problem. II (Q920852) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A concentration inequality for the facility location problem (Q2670506) (← links)
- An upper bound for the average length of the euclidean minimum spanning tree (Q3833626) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
