The following pages link to (Q5417726):
Displaying 9 items.
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- On a representation of the matching polytope via semidefinite liftings (Q2757579) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Near Approximation of Maximum Weight Matching through Efficient Weight Reduction (Q3010385) (← links)
- Robust Independence Systems (Q5892606) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)