Pages that link to "Item:Q3228026"

The following pages link to The shortest path and the shortest road through <i>n</i> points (Q3228026):

Displaying 41 items.

• Watchman tours for polygons with holes (Q419503) (← links)
• On the length of optimal TSP circuits in sets of bounded diameter (Q762465) (← links)
• The dynamic team forming problem: throughput and delay for unbiased policies (Q847121) (← links)
• The minimum backlog problem (Q888427) (← links)
• Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
• Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
• Almost subadditive multiparameter ergodic theorems (Q1115002) (← links)
• Cost of sequential connection for points in space (Q1122502) (← links)
• Submodularity and the traveling salesman problem (Q1124707) (← links)
• Some upper bounds for minimal trees (Q1178229) (← links)
• A primer of the Euclidean Steiner problem (Q1179729) (← links)
• The rectilinear Steiner arborescence problem (Q1186802) (← links)
• Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
• A note on lower bounds for rectilinear Steiner trees (Q1198048) (← links)
• Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
• Asymptotic component densities in programmable gate arrays realizing all circuits of a given size (Q1206434) (← links)
• Nonoscillation theorems in convex sets (Q1219595) (← links)
• Intersections with random geometric objects (Q1392845) (← links)
• The chaotic universe (Q1579826) (← links)
• Continuous approximation models in freight distribution management (Q1688432) (← links)
• Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
• Worst-case demand distributions in vehicle routing (Q1752215) (← links)
• On the depth of combinatorial optimization problems (Q1801676) (← links)
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees (Q1814747) (← links)
• Extremal uniform distribution and random chord lengths (Q1945270) (← links)
• Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
• On the shortest separating cycle (Q2306364) (← links)
• On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) (← links)
• Sigma-delta quantization errors and the traveling salesman problem (Q2476998) (← links)
• Household-Level Economies of Scale in Transportation (Q2957463) (← links)
• Randomized near-neighbor graphs, giant components and applications in data science (Q3299443) (← links)
• The minimal spanning tree and the upper box dimension (Q3372096) (← links)
• Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
• The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
• On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
• (Q5092418) (← links)
• New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
• Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
• Connect the dots: how many random points can a regular curve pass through? (Q5697192) (← links)
• Continuous approximation formulas for location problems (Q6085881) (← links)
• Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)