Edge cover and polymatroid flow problems
From MaRDI portal
Publication:638371
DOI10.1214/EJP.V15-846zbMath1226.90124OpenAlexW2098834620MaRDI 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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Combinatorial probability (60C05)
Related Items (3)
Belief propagation for optimal edge cover in the random complete graph ⋮ The Blind Passenger and the Assignment Problem ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
This page was built for publication: Edge cover and polymatroid flow problems
