Q5091188 (Q5091188): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:39, 29 July 2024

scientific article; zbMATH DE number 7561531

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561531

Statements

scholarly article

0 references

0 references

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1905.06084

0 references

zbMATH Keywords

fair allocation

0 references

configuration LP

0 references

approximation

0 references

integrality gap

0 references

MaRDI profile type

MaRDI publication profile

0 references

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

0 references

Santa claus meets hypergraph matchings

0 references

0 references

The Santa Claus problem

0 references

MaxMin allocation via degree lower-bounded arborescences

0 references

On Allocating Goods to Maximize Fairness

0 references

Restricted Max-Min Fair Allocation

0 references

A Tale of Santa Claus, Hypergraphs and Matroids

0 references

0 references

New Constructive Aspects of the Lovász Local Lemma

0 references

A condition for matchability in hypergraphs

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

A note on the integrality gap of the configuration LP for restricted Santa Claus

0 references

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation

0 references

Identifiers

10.4230/LIPIcs.ICALP.2019.38

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091188

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091188&oldid=36832887"