Edge cover and polymatroid flow problems
From MaRDI portal
Publication:638371
DOI10.1214/EJP.v15-846zbMath1226.90124MaRDI QIDQ638371
Martin Hessler, Johan Wästlund
Publication date: 9 September 2011
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJP-ECP/_ejpecp/viewarticle5645.html
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
60C05: Combinatorial probability
Related Items
Belief propagation for optimal edge cover in the random complete graph, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, The Blind Passenger and the Assignment Problem