Edge cover and polymatroid flow problems

Hessler, MartinLinköpings universitet,Tillämpad matematik,Tekniska högskolan (författare)

In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask for the minimum total cost of a set of edges of which each vertex is incident to at least one. This so-called minimum edge cover problem is a relaxation of perfect matching. We show that the large n limit cost of the minimum edge cover is W(1)(2) + 2W(1) approximate to 1.456, where W is the Lambert W-function. In particular this means that the minimum edge cover is essentially cheaper than the minimum perfect matching, whose limit cost is pi(2)/6 approximate to 1.645. We obtain this result through a generalization of the perfect matching problem to a setting where we impose a (poly-)matroid structure on the two vertex-sets of the graph, and ask for an edge set of prescribed size connecting independent sets.

Wästlund, Johan,1971Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,Chalmers(Swepub:cth)wastlund (författare)
Linköpings universitetTillämpad matematik (creator_code:org_t)

Ingår i:Electronic Journal of Probability: Institute of Mathematical Statistics15, s. 2200-22191083-6489

Om ämnet

Av lärosätet: Linköpings universitet; Chalmers tekniska högskola; Göteborgs universitet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.