Pages that link to "Item:Q1152627"

The following pages link to Subadditive Euclidean functionals and nonlinear growth in geometric probability (Q1152627):

Displayed 50 items.

• Scaling laws for maximum coloring of random geometric graphs (Q516873) ‎ (← links)
• An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (Q752004) ‎ (← links)
• A partitioning algorithm for minimum weighted Euclidean matching (Q794175) ‎ (← links)
• Partitioning heuristics for two geometric maximization problems (Q800827) ‎ (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) ‎ (← links)
• The physicist's approach to the travelling salesman problem. II (Q920852) ‎ (← links)
• Reconstruction of polycrystalline structures: a new application of combinatorial optimization (Q1086259) ‎ (← links)
• Two probabilistic results on rectilinear Steiner trees (Q1105495) ‎ (← links)
• Almost subadditive multiparameter ergodic theorems (Q1115002) ‎ (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) ‎ (← links)
• A primer of the Euclidean Steiner problem (Q1179729) ‎ (← links)
• Euclidean semi-matchings of random samples (Q1184341) ‎ (← links)
• Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) ‎ (← links)
• Asymptotics for the length of a minimal triangulation on a random sample (Q1296585) ‎ (← links)
• Rate of convergence for the Euclidean minimum spanning tree limit law (Q1317005) ‎ (← links)
• On the fluctuations of simple matching (Q1342091) ‎ (← links)
• Asymptotics for transportation cost in high dimensions (Q1345081) ‎ (← links)
• Worst case asymptotics for some classical optimization problems (Q1375702) ‎ (← links)
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) ‎ (← links)
• Continuous approximation models in freight distribution management (Q1688432) ‎ (← links)
• Worst-case demand distributions in vehicle routing (Q1752215) ‎ (← links)
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees (Q1814747) ‎ (← links)
• On the k-center problem with many centers (Q1824540) ‎ (← links)
• Asymptotics for the Euclidean TSP with power weighted edges (Q1893902) ‎ (← links)
• On properties of geometric random problems in the plane (Q1908291) ‎ (← links)
• Asymptotics for Euclidean functionals with power-weighted edges (Q1915837) ‎ (← links)
• Random restricted matching and lower bounds for combinatorial optimization (Q1928532) ‎ (← links)
• Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) ‎ (← links)
• Euclidean travelling salesman problem with location-dependent and power-weighted edges (Q2135191) ‎ (← links)
• Traveling salesman problem across well-connected cities and with location-dependent edge lengths (Q2274794) ‎ (← links)
• An improved lower bound for the traveling salesman constant (Q2294531) ‎ (← links)
• Further results on the probabilistic traveling salesman problem (Q2368298) ‎ (← links)
• Rates of convergence of means of Euclidean functionals (Q2471129) ‎ (← links)
• Ergodic theorems for some classical problems in combinatorial optimization (Q2564700) ‎ (← links)
• The invariance principle for the total length of the nearest-neighbor graph (Q2576795) ‎ (← links)
• Dividing a Territory Among Several Vehicles (Q2815468) ‎ (← links)
• Combinatorial Optimization Over Two Random Point Sets (Q2865119) ‎ (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) ‎ (← links)
• Household-Level Economies of Scale in Transportation (Q2957463) ‎ (← links)
• Randomized near-neighbor graphs, giant components and applications in data science (Q3299443) ‎ (← links)
• A survey of heuristics for the weighted matching problem (Q3315292) ‎ (← links)
• Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) ‎ (← links)
• Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) ‎ (← links)
• Probabilistic Analysis of Geometric Location Problems (Q3686393) ‎ (← links)
• Euclidean matching problems and the metropolis algorithm (Q3727741) ‎ (← links)
• Heuristics for planar minimum‐weight perfect metchings (Q3969883) ‎ (← links)
• Limit of the Transport Capacity of a Dense Wireless Network (Q4933206) ‎ (← links)
• (Q5002651) ‎ (← links)
• Law of large numbers for a two-dimensional class cover problem (Q5030235) ‎ (← links)
• Average optimal cost for the Euclidean TSP in one dimension (Q5055572) ‎ (← links)