scientific article; zbMATH DE number 964350

Publication date: 13 January 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Limit Theorems in Discrete Stochastic Geometry, Up-to-constants comparison of Liouville first passage percolation and Liouville quantum gravity, Optimal Matching of Random Samples and Rates of Convergence of Empirical Measures, Continuous approximation formulas for location problems, Random words in free groups, non-crossing matchings and RNA secondary structures, Optimal transport methods for combinatorial optimization over two random point sets, Extrema of a multinomial assignment process, The Hellinger Correlation, Short-length routes in low-cost networks via Poisson line patterns, The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study, Statistical mechanics methods and phase transitions in optimization problems, Limit theory for the random on‐line nearest‐neighbor graph, Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem, Phase Coexistence for the Hard-Core Model on ℤ², Rooted edges of a minimal directed spanning tree on random points, On the rate of convergence for the length of the longest common subsequences in hidden Markov models, On the total length of the random minimal directed spanning tree, Weak laws of large numbers in geometric probability, The symmetry in the martingale inequality, Strong laws for Euclidean graphs with general edge weights, Asymptotics for weighted minimal spanning trees on random points, Asymptotics for Voronoi tessellations on random samples, Prefix frequency of lost positions, Energy landscape for large average submatrix detection problems in Gaussian random matrices, Robustness-based approach for fuzzy multi-objective problems, Utilization of singularity exponent in nearest neighbor based classifier, Vertex ordering and partitioning problems for random spatial graphs., Euclidean travelling salesman problem with location-dependent and power-weighted edges, Distributionally robust mixed integer linear programs: persistency models with applications, Optimal flow through the disordered lattice, On the quadratic random matching problem in two-dimensional domains, A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting, Concentration of non‐Lipschitz functions and applications, THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS, A stochastic mechanism for signal propagation in the brain: force of rapid random fluctuations in membrane potentials of individual neurons, Dynamical degrees of affine-triangular automorphisms of affine spaces, Average optimal cost for the Euclidean TSP in one dimension, A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability, On the longest increasing subsequence of a circular list, The probabilistic travelling salesman problem with crowdsourcing, Note on the structure of Kruskal's algorithm, The number of Seymour vertices in random tournaments and digraphs, Measure concentration in optimization, Local alignment of Markov chains, Measuring distributional asymmetry with Wasserstein distance and Rademacher symmetrization, Stein’s method and Plancherel measure of the symmetric group, Omnibus sequences, coupon collection, and missing word counts, The simultaneous semi-random model for TSP, Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model, Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process, On the greedy walk problem, A concentration inequality for the facility location problem, Optimal random matchings, tours, and spanning trees in hierarchically separated trees, On the maximum of random assignment process, Pattern avoidance in ordered set partitions, Computing the variance of tour costs over the solution space of the TSP in polynomial time, An asymptotic theory for recurrence relations based on minimization and maximization., Connected spatial networks over random points and a route-length statistic, Minimum Cost Matching in a Random Graph with Random Costs, Rate of convergence of power-weighted Euclidean minimal spanning trees, On the longest common subsequence of conjugation invariant random permutations, Central limit theorems for the radial spanning tree, Total progeny in killed branching random walk, Concentration of measure and cluster analysis., Nearly subadditive sequences, Talagrand's inductive method and isoperimetric inequalities involving random sets, Inductively computable unions of fat linear subspaces, Optimal retirement income tontines, Classical restrictions of generic matrix product states are quasi-locally Gibbsian, The radial spanning tree of a Poisson point process, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, Critical random graphs and the differential equations technique, LIL for the length of the longest increasing subsequences, Laws of large numbers in stochastic geometry with statistical applications, A precise local limit theorem for the multinomial distribution and some applications, Random geometric complexes in the thermodynamic regime, Rates of convergence of means of Euclidean functionals, Scaling laws for maximum coloring of random geometric graphs, Asymptotic sequential Rademacher complexity of a finite function class, Worst-case demand distributions in vehicle routing, Approximation to the mean curve in the LCS problem, Sigma-delta quantization errors and the traveling salesman problem, Distribution-sensitive construction of the greedy spanner, \(L_p\) compression, traveling salesmen, and stable walks., Asymptotic properties of combinatorial optimization problems in \(p\)-adic space, Random minimal directed spanning trees and Dickman-type distributions, The matching, birthday and the strong birthday problem: a contemporary review, Sample path optimality for a Markov optimization problem, Geodesics and flows in a Poissonian city, Large deviations for global maxima of independent superadditive processes with negative drift and an application to optimal sequence alignments, Explicit laws of large numbers for random nearest-neighbour-type graphs, Random growth models with polygonal shapes, A survey of max-type recursive distributional equations, Asymptotic laws for compositions derived from transformed subordinators, A note on uniform or Banach density, Super-multiplicativity and a lower bound for the decay of the signature of a path of finite length, Microscopic path structure of optimally aligned random sequences, A new lower bound for the geometric traveling salesman problem in terms of discrepancy, Limit theorems for random spatial drainage networks, On the asymptotic order of circuit codes, Near-minimal spanning trees: A scaling exponent in probability models, Nearest-neighbor graphs on the cantor set, Asymptotic properties of Dirichlet kernel density estimators, Threshold and complexity results for the cover pebbling game, The overlap gap property in principal submatrix recovery, A general method for lower bounds on fluctuations of random variables, Random maximal independent sets and the unfriendly theater seating arrangement problem, Asymptotics for the length of a minimal triangulation on a random sample, Copulas in Machine Learning, Sample complexity for Markov chain self-tuner, An analytic study of the phase transition line in local sequence alignment with gaps, Self-attracting self-avoiding walk, Asymptotic of power-weighted Euclidean functionals, Combinatorial Optimization Over Two Random Point Sets, Cover Pebbling Thresholds for the Complete Graph, Additivity rates and PPT property for random quantum channels, Gaussian tail for empirical distributions of MST on random graphs