Bipartite Matching with Linear Edge Weights

DOI10.4230/LIPIcs.ISAAC.2016.28zbMath1398.05195OpenAlexW2576041697MaRDI QIDQ4636510

Nevzat Onur Domaniç, C. Gregory Plaxton, Chi-Kit Lam

Publication date: 19 April 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/isaac/isaac2016.html#DomanicLP16

zbMATH Keywords

weighted bipartite matchingunit-demand auctionsVCG allocation and pricing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Auctions, bargaining, bidding and selling, and other market models (91B26) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

On an ordering problem in weighted hypergraphs

This page was built for publication: Bipartite Matching with Linear Edge Weights