Pages that link to "Item:Q684403"
From MaRDI portal
The following pages link to On the fractional matching polytope of a hypergraph (Q684403):
Displayed 18 items.
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- An Approximation Result for Matchings in Partitioned Hypergraphs (Q2806888) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture (Q6077050) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)