Santa Claus Meets Hypergraph Matchings (Q3541783): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q172552 / rank | |||
Property / author | |||
Property / author: Uriel Feige / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1578813712 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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
Santa Claus Meets Hypergraph Matchings (English)
0 references
27 November 2008
0 references