Pages that link to "Item:Q3009775"
From MaRDI portal
The following pages link to Iterative Packing for Demand and Hypergraph Matching (Q3009775):
Displaying 7 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Constant factor approximation for the weighted partial degree bounded edge packing problem (Q1631679) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)