Better trees for Santa Claus (Q6499346): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Lazy Local Search Meets Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Algorithm for Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa claus meets hypergraph matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxMin allocation via degree lower-bounded arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Allocating Goods to Maximize Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tale of Santa Claus, Hypergraphs and Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph balancing: a special case of scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for matchability in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the makespan of the two-valued restricted assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Polynomial Approximation for the Restricted Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Santa Claus Schedules Jobs on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the configuration-LP for scheduling on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:44, 3 December 2024

scientific article; zbMATH DE number 7844717
Language Label Description Also known as
English
Better trees for Santa Claus
scientific article; zbMATH DE number 7844717

    Statements

    Better trees for Santa Claus (English)
    0 references
    0 references
    0 references
    8 May 2024
    0 references
    Lovasz local Lemma
    0 references
    allocation
    0 references
    fairness
    0 references
    max-min
    0 references
    0 references
    0 references
    0 references

    Identifiers