Pages that link to "Item:Q5741733"
From MaRDI portal
The following pages link to How to Sell Hyperedges: The Hypermatching Assignment Problem (Q5741733):
Displaying 14 items.
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- (Q5005186) (← links)
- (Q5009517) (← links)
- (Q5091238) (← links)
- (Q5136324) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)
