Pages that link to "Item:Q5172749"
From MaRDI portal
The following pages link to MaxMin allocation via degree lower-bounded arborescences (Q5172749):
Displaying 25 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- The efficiency of fair division (Q692886) (← links)
- APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- (Q5005186) (← links)
- (Q5091188) (← links)
- (Q5091238) (← links)
- (Q5116488) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
