On maximin share allocations in matroids (Q1628590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.05.018 / 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.1016/j.tcs.2018.05.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803597015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Computing Maximin Share Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on bases in dependence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable distribution of indivisible objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Maximin Share Allocations in Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Protocol for Cutting Matroids Like Cakes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case compromises in matroids with applications to the allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiple Exchange Property for Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Abstract Pivot Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning general probability measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exchange theorem for bases of matroids / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129824788 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.05.018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:36, 10 December 2024

scientific article
Language Label Description Also known as
English
On maximin share allocations in matroids
scientific article

    Statements

    Identifiers