Elsevier

Theoretical Computer Science

Volume 454, 5 October 2012, Pages 136-163
Theoretical Computer Science

A combinatoric interpretation of dual variables for weighted matching and f-factors

https://doi.org/10.1016/j.tcs.2012.06.024Get rights and content
Under an Elsevier user license
open archive

Abstract

The linear program dual variables for weighted matching and its generalization to f-factors are shown to be the weights of certain subgraphs: y duals are the weights of certain maximum matchings or f-factors; z duals are the weights of certain 2-factors or 2f-factors. Similar interpretations have been given for the bipartite case of these problems, where only y duals occur, but our variant is included here for completeness. In all cases the y duals are canonical in a well-defined sense; z duals are canonical for matching and more generally for b-matchings (a special case of f-factors) but for f-factors their support can vary. As weights of combinatoric objects the duals are integral for given integral edge weights, and so they give new proofs that the linear programs for these problems are TDI.

Keywords

Graph
Matching
b-matching
f-factor
Blossom
Dual variables

Cited by (0)