Publication:3549637

zbMath1232.68071MaRDI QIDQ3549637

Adriana Karagiozova, Elliot Anshelevich

Publication date: 5 January 2009

zbMATH Keywords

simplex matching; non-bipartite min-cost matching; terminal backup problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

On Min-Max r-Gatherings, On min-max \(r\)-gatherings, Exact and approximate equilibria for optimal group network formation