On the Expected Value of a Random Assignment Problem
From MaRDI portal
Publication:3048272
DOI10.1137/0208036zbMath0413.68062MaRDI QIDQ3048272
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208036
68R10: Graph theory (including graph drawing) in computer science
68R99: Discrete mathematics in relation to computer science
Related Items
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment, The mean field traveling salesman and related problems, Selected topics on assignment problems, Asymptotic results for random multidimensional assignment problems, Asymptotic behavior of the expected optimal value of the multidimensional assignment problem, Random assignment problems, On the connectivity of random m-orientable graphs and digraphs, An analysis of a decomposition heuristic for the assignment problem, On the value of a random minimum spanning tree problem, Probabilistic asymptotic properties of some combinatorial optimization problems, The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach, On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees, Order statistics and the linear assignment problem, Maximal paths in random dynamic graphs, Matchings in random regular bipartite digraphs, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, One-factor in random graphs based on vertex choice, Asymptotics in the random assignment problem, On the expected optimal value of random assignment problems: Experimental results and open questions, Minimean optimal key arrangements in hash tables, Concentration of measure and isoperimetric inequalities in product spaces, The ?(2) limit in the random assignment problem, The asymptotic probabilistic behaviour of quadratic sum assignment problems, On linear programs with random costs, Unnamed Item
