scientific article; zbMATH DE number 3607833
From MaRDI portal
Publication:4173215
zbMath0391.90090MaRDI QIDQ4173215
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational EfficiencyProbabilistic AnalysisPartitioning AlgorithmsTraveling Salesman in the Plane
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)
Related Items (5)
Fast probabilistic algorithms for Hamiltonian circuits and matchings ⋮ A guided tour of Chernoff bounds ⋮ On the theory of average case complexity ⋮ On the solutions of stochastic traveling salesman problems ⋮ Limit distribution for the existence of Hamiltonian cycles in a random graph
This page was built for publication:
