Pages that link to "Item:Q3541783"
From MaRDI portal
The following pages link to Santa Claus Meets Hypergraph Matchings (Q3541783):
Displaying 8 items.
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
