Santa Claus Meets Hypergraph Matchings (Q3541783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hall's theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximizing welfare when utility functions are subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for matchability in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / 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: Q3549686 / rank
 
Normal rank

Latest revision as of 20:27, 28 June 2024

scientific article
Language Label Description Also known as
English
Santa Claus Meets Hypergraph Matchings
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references