Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Stable matching polytope (view)

searching for Matching polytope 5 found (19 total)

Blossom algorithm (2,022 words) [view diff] exact match in snippet view article find links to article

that it led to a linear programming polyhedral description of the matching polytope, yielding an algorithm for min-weight matching. As elaborated by Alexander

Symposium on Theory of Computing (1,162 words) [view diff] exact match in snippet view article find links to article

Prabhakar Raghavan (2013), Plenary talk 2014 Thomas Rothvoss (2014), "The matching polytope has exponential extension complexity" Shafi Goldwasser (2014), "The

Fractional coloring (1,272 words) [view diff] exact match in snippet view article find links to article

polynomial time. This is a straightforward consequence of Edmonds' matching polytope theorem. Applications of fractional graph coloring include activity

Gödel Prize (2,108 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1145/2716307. S2CID 7372000. Rothvoss, Thomas (2017). "The Matching Polytope has Exponential Extension Complexity". Journal of the ACM. 64 (6):

Linear programming (6,567 words) [view diff] exact match in snippet view article find links to article

dual integrality. Other specific well-known integral LPs include the matching polytope, lattice polyhedra, submodular flow polyhedra, and the intersection